Proper Connection Number of Graph Products
作者： Yaping Mao , Fengnan Yanling , Zhao Wang , Chengfu Ye
DOI: 10.1007/S40840-016-0442-Z
关键词: Induced path 、 Complement graph 、 Combinatorics 、 Graph toughness 、 Distance 、 Path graph 、 Connected component 、 Discrete mathematics 、 Mathematics 、 Graph power 、 k-vertex-connected graph
摘要: A path P in an edge-colored graph G is called a proper if no two adjacent edges of are colored the same, and connected every vertices by G. The connection number G, denoted pc(G), minimum colors that needed to make connected. In this paper, we study on lexicographic, strong, Cartesian, direct products present exact values or upper bounds for these graphs.
springer.com
sci-hub.se 参考文章(38)
Ghidewon Abay-Asmerom, Richard Hammack, Centers of Tensor Products of Graphs. Ars Combinatoria. ,vol. 74, ,(2005)
Yuefang Sun, Rainbow Connections of Graphs ,(2012)
Fei Huang, Xueliang Li, Shujing Wang, Proper Connection Numbers of Complementary Graphs Bulletin of the Malaysian Mathematical Sciences Society. ,vol. 41, pp. 1199- 1209 ,(2018) , 10.1007/S40840-016-0381-8
Yaping Mao, Fengnan Yanling, Zhao Wang, Chengfu Ye, Rainbow vertex-connection and graph products International Journal of Computer Mathematics. ,vol. 93, pp. 1078- 1092 ,(2016) , 10.1080/00207160.2015.1047356
Xueliang Li, Meiqin Wei, Jun Yue, Proper connection number and connected dominating sets Theoretical Computer Science. ,vol. 607, pp. 480- 487 ,(2015) , 10.1016/J.TCS.2015.06.006
Simon Špacapan, Connectivity of Strong Products of Graphs Graphs and Combinatorics. ,vol. 26, pp. 457- 467 ,(2010) , 10.1007/S00373-010-0919-8
Gary Chartrand, Ping Zhang, Garry L. Johns, Kathleen A. McKeon, The rainbow connectivity of a graph Networks. ,vol. 54, pp. 75- 81 ,(2009) , 10.1002/NET.V54:2
Simon Špacapan, A characterization of the edge connectivity of direct products of graphs Discrete Mathematics. ,vol. 313, pp. 1385- 1393 ,(2013) , 10.1016/J.DISC.2013.02.011
Xiaolong Huang, Xueliang Li, Yongtang Shi, Note on the Hardness of Rainbow Connections for Planar and Line Graphs Bulletin of the Malaysian Mathematical Sciences Society. ,vol. 38, pp. 1235- 1241 ,(2015) , 10.1007/S40840-014-0077-X
Yaping Mao, Path-connectivity of lexicographic product graphs International Journal of Computer Mathematics. ,vol. 93, pp. 27- 39 ,(2016) , 10.1080/00207160.2014.987762