Abstract
Given a graph G, a vertex ranking (or simply, ranking) of G is a mapping f from V ( G ) to the set of all positive integers, such that for any path between two distinct vertices u and v with f ( u ) = f ( v ) , there is a vertex w in the path with f ( w ) > f ( u ) . If f is a ranking of G, the ranking number of G under f, denoted γ f ( G ) , is defined by γ f ( G ) = max { f ( v ) : v ∈ V ( G ) } , and the ranking number of G, denoted γ ( G ) , is defined by γ ( G ) = min { γ f ( G ) : f is a ranking of G } . The vertex ranking problem is to determine the ranking number γ ( G ) of a given graph G. This problem is a natural model for the manufacturing scheduling problem. We study the ranking numbers of graphs in this paper. We consider the relation between the ranking numbers and the minimal cut sets, and the relation between the ranking numbers and the independent sets. From this, we obtain the ranking numbers of the powers of paths and the powers of cycles, the Cartesian product of P 2 with P n or C n , and the caterpilars. And we also find the vertex ranking numbers of the composition of two graphs in this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
