On k-sequential and other numbered graphs |
| |
Authors: | Peter J Slater |
| |
Institution: | A.U.S. Department of Energy Facility, Sandia Laboratories, Albuquerque, NM 87185, USA |
| |
Abstract: | The concept of a k-sequential graph is presented as follows. A graph G with ∣V(G)∪ E(G)∣=t is called k-sequential if there is a bijection such that for each edgein E(G) one has. A graph that is 1-sequential is called simply sequential, and, in particular the author has conjectured that all trees are simply sequential. In this paper an introductory study of k-sequential graphs is made. Further, several variations on the problems of gracefully or sequentially numbering the elements of a graph are discussed. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|