Rank numbers of graphs that are combinations of paths and cycles
Brianna Blake, Elizabeth Field, Jobby Jacob · Involve a Journal of Mathematics · 2013
The rank number of G, denoted χ r (G), is the minimum k such that a k-ranking exists for G.It is shown that given a graph G and a positive integer t, the question of whether χ r (G) ≤ t is NP-complete.However, the rank number of numerous families of graphs have been established.We study and establish rank numbers of some more families of graphs that are combinations of paths and cycles.