Spectral radius and Hamiltonicity of graphs
classification
🧮 math.CO
keywords
hamiltonicityadjacencycomplementconditionseigenvaluegivegivengraph
read the original abstract
Let G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.