Related papers: M-Polynomial of Product Graphs
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
The purpose of this paper is to obtain some sufficient conditions to determine the relation between a meromorphic function and an L-function when certain differential polynomial generated by them sharing a one degree polynomial. The main…
The toric fiber product is a general procedure for gluing two ideals, homogeneous with respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products generalize familiar constructions in commutative algebra like…
The vertex PI index is a distance--based molecular structure descriptor, that recently found numerous chemical applications. In order to increase diversity of this topological index for bipartite graphs, we introduce weighted version…
The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. It is a topological invariant of a graph, which was defined by W.T. Tutte in 1963 and also has important…
Multiperforated plates exhibit high gradients and a loss of regularity concentrated in a boundary layer for which a direct numerical simulation becomes very expensive. For elliptic equations the solution at some distance of the boundary is…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
A study is made of real Lie algebras admitting compatible complex and product structures, including numerous 4-dimensional examples. If g is a Lie algebra with such a structure then its complexification has a hypercomplex structure. It is…
We investigate string graphs through the lens of graph product structure theory, which describes complicated graphs as subgraphs of strong products of simpler building blocks. A graph $G$ is called a string graph if its vertices can be…
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$. We also prove a lemma that is helpful to determine the…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…
The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…
This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…
We study the independence complexes of graph products where at least one factor is a path. We also analyze the complexes of their induced subgraphs. We determine the homotopy type of the independence complex of the graphs $P_n\times P_m$,…
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the…
The $m$-symmetric Macdonald polynomials form a basis of the space of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},\dots$ (while having no special symmetry in the variables $x_1,\dots,x_m$).We establish in this article…
In textbooks and historical literature, the cross product has been defined only in 2-dimensional and 3-dimensional Euclidean spaces and the cross product of only two vectors has been defined only in the high dimensional Euclidean space…
We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at…
We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…