On Path-pairability in the Cartesian Product
نویسندگان
چکیده
9 We study the inheritance of path-pairability in the Cartesian product of 10 graphs and prove additive and multiplicative inheritance patterns of path11 pairability, depending on the number of vertices in the Cartesian product. 12 We present path-pairable graph families that improve the known upper 13 bound on the minimal maximum degree of a path-pairable graph. Further 14 results and open questions about path-pairability are also presented. 15
منابع مشابه
Linkedness and Path-Pairability in the Cartesian Product of Graphs
In this dissertation I summarize my work in the field of linkedness and pathpairability of graphs with primary focus on the inheritance of the mentioned properties in the Cartesian product of graphs. We obtain a general additive inheritance bound for linkedness. We determine the exact linkedness number of hypercubes, as well as affine and projective grids of arbitrary dimensions. Similar inheri...
متن کاملNote on terminal-pairability in complete grid graphs
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessary maximum degree in path-pairable graphs, a question originally raised and studied by Faudree, Gyárfás, and Lehel (1999). © 2017 Elsevier B...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملThe Merrifield-Simmons indices and Hosoya indices of some classes of cartesian graph product
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کامل