Abstract
Products of graphs occur naturally in discrete mathematics as tools in combinatorial constructions and give rise to important classes of graphs and deep structural problems. The extensive literature on products that has evolved over the years presents a wealth of profound and beautiful results, see Imrich and Klavzar (Product Graphs–Structure and Recognition, Wiley, New York, 2000). In (Characterize graphs with rainbow connection number m − 2 and rainbow connection numbers of some graph operations, submitted, June, 2010), Li and Sun obtained some results on the rainbow connection numbers of products of graphs, including Cartesian product, composition (lexicographic product) and join of graphs, etc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Xueliang Li, Yuefang Sun
About this chapter
Cite this chapter
Li, X., Sun, Y. (2012). Rainbow Connection Numbers of Graph Products. In: Rainbow Connections of Graphs. SpringerBriefs in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3119-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3119-0_6
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-3118-3
Online ISBN: 978-1-4614-3119-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)