The Completion of a Classification for Maximal Nonhamiltonian Burkard–Hammer Graphs
- 54 Downloads
A graph G=(V,E) is called a split graph if there exists a partition V=I∪K such that the subgraphs G[I] and G[K] of G induced by I and K are empty and complete graphs, respectively. Burkard and Hammer gave a necessary condition for a split graph G with |I|<|K| to be Hamiltonian (J. Comb. Theory, Ser. B 28:245–248, 1980). We will call a split graph G with |I|<|K| satisfying this condition a Burkard–Hammer graph. Further, a split graph G is called a maximal nonhamiltonian split graph if G is nonhamiltonian but G+uv is Hamiltonian for every \(uv\not\in E\), where u∈I and v∈K. N.D. Tan and L.X. Hung have classified maximal nonhamiltonian Burkard–Hammer graphs G with minimum degree δ(G)≥|I|−3. Recently, N.D. Tan and Iamjaroen have classified maximal nonhamiltonian Burkard–Hammer graphs with |I|≠6,7 and δ(G)=|I|−4. In this paper, we complete the classification of maximal nonhamiltonian Burkard–Hammer graphs with δ(G)=|I|−4 by finding all such graphs for the case |I|=6,7.
KeywordsSplit graph Burkard–Hammer condition Burkard–Hammer graph Hamiltonian graph Maximal nonhamiltonian split graph
Mathematics Subject Classification (2000)05C45 05C75
I would like to express my sincere thanks to the referee for his valuable remarks which helped me to improve the paper.
- 4.Földes, S., Hammer, P.L.: Split graphs. In: Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, LA, 1977. Congressus Numerantium, vol. XIX, pp. 311–315. Utilitas Math., Winnipeg (1977) Google Scholar
- 5.Földes, S., Hammer, P.L.: On a class of matroid-producing graphs. In: Combinatorics, Proc. Fifth Hungarian Colloq., Keszthely, 1976. Colloq. Math. Soc. Janós Bolyai 18, vol. 1, pp. 331–352. North-Holland, Amsterdam (1978) Google Scholar
- 10.Peled, U.N.: Regular Boolean functions and their polytope. Chap. VI, Ph.D. Thesis, Univ. Waterloo, Dept. Comb. Optim. (1975) Google Scholar
- 14.Tan, N.D., Iamjaroen, C.: Constructions for nonhamiltonian Burkard–Hammer graphs. In: Combinatorial Geometry and Graph Theory (Proc. of Indonesia–Japan Joint Conf.), Bandung, Indonesia, September 13–16, 2003. Lect. Notes Comput. Sci., vol. 3330, pp. 185–199. Springer, Berlin (2005) CrossRefGoogle Scholar