Abstract
In this paper, we construct a family of graphs denoted by Eye(s) that are 3-regualr, 3-connected, planar, hamiltonian, edge hamiltonian, and also optimal 1-hamiltonian. Furthermore, the diameter of Eye(s) is O(log n), where n is the number of vertices in the graph and to be precise, n = 6(2s − 1) vertices.
Cite
CITATION STYLE
APA
Wang, J. J., Sung, T. Y., Hsu, L. H., & Lin, M. Y. (1998). A new family of optimal 1-hamiltonian graphs with small diameter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1449, pp. 269–278). Springer Verlag. https://doi.org/10.1007/3-540-68535-9_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free