Open AccessHAMILTONICITY OF CAMOUFLAGE GRAPHS
Author(s) -
K Sowmiya
Publication year - 2021
Publication title -
international journal of engineering applied science and technology
Language(s) - English
Resource type - Journals
ISSN - 2455-2143
DOI - 10.33564/ijeast.2021.v05i10.022
Subject(s) - combinatorics , mathematics , bipartite graph , hamiltonian path , indifference graph , discrete mathematics , cograph , conjecture , chordal graph , 1 planar graph , graph
This paper examines the Hamiltonicity of graphshaving some hidden behaviours of some other graphs in it.The well-known mathematician Barnette introduced theopen conjecture which becomes a theorem by restrictingour attention to the class of graphs which is 3-regular, 3-connected, bipartite, planar graphs having odd number ofvertices in its partition be proved as a Hamiltonian.Consequently the result proved in this paper stated that“Every connected vertex-transitive simple graph has aHamilton path” shows a significant improvement over theprevious efforts by L.Babai and L.Lovasz who put forththis conjecture. And we characterize a graphic sequencewhich is forcibly Hamiltonian if every simple graph withdegree sequence is Hamiltonian. Thus we discussedabout the concealed graphs which are proven to beHamiltonian.