|
|||||
|
|
Rank numbers for some trees and unicyclic graphs |
|
| Authors: | Emily Sergel Peter Richter Anh Tran Patrick Curran Jobby Jacob Darren A Narayan |
| Institution: | 1. Department of Mathematics, Rutgers University, Piscataway, NJ, 08854-8019, USA 2. Department of Mathematics, University of Rochester, Rochester, NY, 14642-0002, USA 3. School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY, 14623-5604, USA |
| Abstract: | A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices of the same rank contains a vertex of strictly larger rank. The rank number of a graph is the fewest number of labels that can be used in a ranking. In this paper we determine rank numbers for some trees and unicyclic graphs. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |