Abstract
For any given graph G, we know that 1 ≤ rc(G) ≤ src(G) ≤ m. Here a graph G is called a dense graph if its (strong) rainbow connection number is small, especially it is close to 1; while G is called a sparse graph if its (strong) rainbow connection number is large, especially it is close to m. By Proposition 1.3.1, the cases that \(rc(G) = 1,src(G) = 1\) and \(rc(G) = m,src(G) = m\) are clear. So what we want to investigate are the other cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Dense and Sparse Graphs. In: Rainbow Connections of Graphs. SpringerBriefs in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-3119-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3119-0_4
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)