On hyper-Hamiltonicity in graphs

DOI10.1016/j.dam.2019.08.023zbMath1440.05135OpenAlexW2973710235MaRDI QIDQ2184681

Cybele T. M. Vinagre, Renata R. Del-Vecchio, Guilherme B. Pereira

Publication date: 29 May 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.023

zbMATH Keywords

adjacency matrixLaplacian matrixsignless Laplacian matrixdistance matrixhyper-Hamiltonian graph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Signless Laplacian spectral radius and Hamiltonicity
• Hamiltonian threshold graphs
• A method in graph theory
• Degree maximal graphs are Laplacian integral
• A bound on the spectral radius of graphs with \(e\) edges
• Hyper-Hamiltonicity in graphs: some sufficient conditions
• Recent advances on the Hamiltonian problem: survey III
• Hyper-Hamiltonian generalized Petersen graphs
• Note on Hamilton Circuits
• Spectral Radius and Degree Sequence
• Some Theorems on Abstract Graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: On hyper-Hamiltonicity in graphs