Hamiltonian spectra of graphs
From MaRDI portal
Publication:2000574
Recommendations
Cites work
- scientific article; zbMATH DE number 431365 (Why is no real title available?)
- scientific article; zbMATH DE number 95322 (Why is no real title available?)
- scientific article; zbMATH DE number 3501535 (Why is no real title available?)
- scientific article; zbMATH DE number 3515497 (Why is no real title available?)
- scientific article; zbMATH DE number 2077679 (Why is no real title available?)
- scientific article; zbMATH DE number 2109324 (Why is no real title available?)
- A method in graph theory
- An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
- An upper bound on the length of a Hamiltonian walk of a maximal planar graph
- Graph theory with applications
- Hamiltonian numbers in oriented graphs
- Hamiltonian numbers of Möbius double loop networks
- On Hamiltonian Walks in Graphs
- The Hamiltonian Number of Cubic Graphs
- The Hamiltonian number of graphs with prescribed connectivity
- The Hamiltonian numbers in digraphs
- Upper Hamiltonian numbers and Hamiltonian spectra of graphs
Cited in
(9)- scientific article; zbMATH DE number 6401583 (Why is no real title available?)
- Combinations of some spectral invariants and Hamiltonian properties of graphs
- Generalized cospectral graphs with and without Hamiltonian cycles
- Hamiltonian spectra of trees.
- Hamiltonian graphs as harmonic tools
- The Hamiltonian numbers in digraphs
- The integer-antimagic spectra of Hamiltonian graphs
- Hamiltonian and Lagrangian bond graphs
- Spectral radius and Hamiltonian properties of graphs
This page was built for publication: Hamiltonian spectra of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000574)