Graphs with large rank numbers and rank numbers of subdivided stars
A -ranking of a graph is a function such that if then every path contains a vertex such that . The rank number of , denoted , is the minimum such that a -ranking exists for . It is known that given a graph and a positive integer the question of whether is NP-complete. In this paper we characterize g...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.023 |