Hyper-Hamiltonicity in graphs: some sufficient conditions
From MaRDI portal
Publication:2413166
DOI10.1016/J.ENDM.2017.10.029zbMATH Open1383.05185OpenAlexW2767062736MaRDI QIDQ2413166FDOQ2413166
Authors: Renata Del-Vecchio, Cybele T. M. Vinagre, Guilherme B. Pereira
Publication date: 9 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.029
Recommendations
Laplacian matrixspectral radiusadjacency matrixdistance matrixhyper-Hamiltonian graphsingless Laplacian matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Signless Laplacian spectral radius and Hamiltonicity
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonicity of graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Note on Hamilton Circuits
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- Degree maximal graphs are Laplacian integral
- A method in graph theory
- On \(3^*\)-connected graphs
- Hamiltonian threshold graphs
- Hyper-Hamiltonian generalized Petersen graphs
Cited In (9)
- On hyper-Hamiltonian Cartesian product of undirected cycles
- When the Cartesian product of directed cycles is hyper-Hamiltonian
- Title not available (Why is that?)
- SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts
- Hyper-Hamiltonian circulants
- no-homomorphism conditions for hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On hyper-Hamiltonicity in graphs
This page was built for publication: Hyper-Hamiltonicity in graphs: some sufficient conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413166)