arXiv:2010.02792 [math.CO]AbstractReferencesReviewsResources
Optimal orientations of vertex-multiplications of cartesian products of graphs
Published 2020-10-06Version 1
Koh and Tay proved a fundamental classification of $G$ vertex-multiplications into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\mathscr{C}_2$. In this paper, we prove that vertex-multiplications of cartesian products of graphs $G\times H$ lie in $\mathscr{C}_0$ ($\mathscr{C}_0\cup \mathscr{C}_1$ resp.) if $G^{(2)}\in \mathscr{C}_0$ ($\mathscr{C}_1$ resp.), $d(G)\ge 2$ and $d(G\times H)\ge 4$. We also focus on cartesian products involving trees, paths and cycles and show that most of them lie in $\mathscr{C}_0$.
Comments: 29 pages
Categories: math.CO
Related articles: Most relevant | Search more
On the Metric Dimension of Cartesian Products of Graphs
José Cáceres, Carmen Hernando, Mercé Mora, Ignacio M. Pelayo, María L. Puertas, Carlos Seara, David R. Wood
arXiv:2007.15921 [math.CO] (Published 2020-07-31)
The Localization Game On Cartesian Products
Application of some techniques in Sperner Theory: Optimal orientations of vertex-multiplications of trees with diameter 4