Access the full text.
Sign up today, get DeepDyve free for 14 days.
K. Day, A. Al-Ayyoub (1997)
The Cross Product of Interconnection NetworksIEEE Trans. Parallel Distributed Syst., 8
G. Chartrand, Garry Johns, K. McKeon, Ping Zhang (2008)
Rainbow connection in graphs, 133
R Hammack, W Imrich, S Klavžar (2011)
Handbook of Product Graphs
Raxida Guji, Elkin Vumar (2009)
A note on the connectivity of Kronecker products of graphsAppl. Math. Lett., 22
(1991)
Centers of a tensor composite graph
Xuding Zhu (2008)
Game coloring the Cartesian product of graphsJournal of Graph Theory, 59
G Chartrand, GL Johns, KA McKeon, P Zhang (2009)
The rainbow connectivity of a graphNetworks, 54
Xueliang Li, Yongtang Shi, Yuefang Sun (2011)
Rainbow Connections of Graphs: A SurveyGraphs and Combinatorics, 29
G Chartrand, F Okamoto, P Zhang (2010)
Rainbow trees in graphs and generalized connectivityNetworks, 55
Y. Mao (2015)
The Vertex-Rainbow Index of A GraphDiscussiones Mathematicae Graph Theory, 36
Fei Huang, Xueliang Li, Shujing Wang (2015)
Proper Connection Numbers of Complementary GraphsBulletin of the Malaysian Mathematical Sciences Society, 41
Simon Spacapan (2010)
Connectivity of Strong Products of GraphsGraphs and Combinatorics, 26
B. Brešar, Simon Spacapan (2008)
On the connectivity of the direct product of graphsAustralas. J Comb., 41
C. FITINA, T. Mills (2011)
ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS
Y Mao (2016)
Path-connectivity of lexicographical product graphsInt. J. Comput. Math., 93
Y. Mao, Feng Yanling, Zhao Wang, Chengfu Ye (2016)
Rainbow vertex-connection and graph productsInternational Journal of Computer Mathematics, 93
M. Mathematical, Xueliang Li, Yuefang Sun (2013)
On the Strong Rainbow Connection of a Graph
Simon Spacapan (2012)
A characterization of the edge connectivity of direct products of graphsDiscret. Math., 313
E. Andrews, C. Lumduanhom, Elliot Laforge, Ping Zhang (2016)
On proper-path colorings in graphsThe journal of combinatorial mathematics and combinatorial computing, 97
P Fragopoulou, SG Akl, H Meijer (1996)
Optimal communication primitives on the generalized hypercube networkIEEE Trans. Parallel Distrib. Comput., 32
Xueliang Li, Meiqin Wei, Jun Yue (2015)
Proper connection number and connected dominating setsTheor. Comput. Sci., 607
S. Johnsson, C. Ho (1989)
Optimum Broadcasting and Personalized Communication in HypercubesIEEE Trans. Computers, 38
P. Weichsel (1962)
THE KRONECKER PRODUCT OF GRAPHS, 13
Xueliang Li, Yuefang Sun (2012)
Rainbow Connections of Graphs
(2011)
Handbook of Product Graphs, 2nd edn
Bijo Anand, M. Changat, S. Klavžar, Iztok Peterin (2012)
Convex Sets in Lexicographic Products of GraphsGraphs and Combinatorics, 28
S. Klavžar, Simon Spacapan (2008)
ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHSAsian-european Journal of Mathematics, 01
Xiaolong Huang, Xueliang Li, Yongtang Shi (2015)
Note on the Hardness of Rainbow Connections for Planar and Line GraphsBulletin of the Malaysian Mathematical Sciences Society, 38
G. Chartrand, Garry Johns, K. McKeon, Ping Zhang (2009)
A survey of some network reliability analysis and synthesis resultsNetworks, 54
W. L. (1883)
RainbowScience
P. Jha, S. Klavžar, B. Zmazek (1997)
Isomorphic components of Kronecker product of bipartite graphsDiscuss. Math. Graph Theory, 17
J. Bang-Jensen, Marco Chiarandini, Peter Morling (2010)
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentationNetworks, 55
AA Ghidewon, R Hammack (2005)
Centers of tensor product of graphsArs Comb., 74
Qingqiong Cai, Xueliang Li, Jiangli Song (2013)
The $$(k,\ell )$$(k,ℓ)-Rainbow Index for Complete Bipartite and Multipartite GraphsBulletin of the Malaysian Mathematical Sciences Society, 39
R. Nowakowski, K. Seyffarth (2008)
Small cycle double covers of products I: Lexicographic product with paths and cyclesJournal of Graph Theory, 57
(1996)
S.G.,Meijer,H.:Optimal communicationprimitives on thegeneralizedhypercube network
Sajal Das, Sabine Öhring, A. Banerjee (1995)
Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection TopologyVLSI Design, 2
A path P in an edge-colored graph G is called a proper path if no two adjacent edges of P are colored the same, and G is proper connected if every two vertices of G are connected by a proper path in G. The proper connection number of a connected graph G, denoted by pc(G), is the minimum number of colors that are needed to make G proper connected. In this paper, we study the proper connection number on the lexicographic, strong, Cartesian, and direct products and present exact values or upper bounds for these products of graphs.
Bulletin of the Malaysian Mathematical Sciences Society – Springer Journals
Published: Feb 22, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.