Minimally (p-6)-Hamiltonian Graphs

Jump To References Section

Authors

  • Vasanti N. Bhat
     University of Bombay ,IN
  • S. F. Kapoor
     Western Michigan University ,US

Abstract

In view of the lack of a practical characterization of hamiltonian graphs, highly hamiltonian graphs were introduced in [2], and a graph G on p vertices was called n-hamiltonian, 0 ≤ n ≤ p-3, if all the graphs obtained by removing at most n vertices from G are hamiltonian.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Downloads

Published

1974-12-01

How to Cite

Bhat, V. N., & Kapoor, S. F. (1974). Minimally (p-6)-Hamiltonian Graphs. The Journal of the Indian Mathematical Society, 38(1-4), 207–214. Retrieved from https://informaticsjournals.com/index.php/jims/article/view/16693

Issue

Volume 38, Issue 1-4, March-December 1974

Section

Articles

License

Copyright (c) 1974 Vasanti N. Bhat, S. F. Kapoor

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

 

References

V. N. BHAT AND S. F. KAPOOR, Minimally n-hamiltoaian graphs, J. Indian Math. Soc, 37 (1973) 277-284.

G. CHARTRAND, S. F. KAPOOR AND D. R. LICK, n-Hamiltonian graphs J. Combinatorial Theory 9 (1970), 308-312.

F. HARARY, Graph Theory, Addison-Wesley, Reading, 1969.

M. D.PLUMMER, On minimal blocks, Trans. Amer. Math. Soc, 134 (1968), 85-94.