A domain monotonicity theorem for graphs and Hamiltonicity
From MaRDI portal
(Redirected from Publication:1192950)
Recommendations
Cites work
- scientific article; zbMATH DE number 3722680 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- A new 5‐arc‐transitive cubic graph
- Eigenvalues and expanders
- Eigenvalues of the Laplacian of a graph∗
- Isoperimetric numbers of graphs
- On the Shannon capacity of a graph
- Ramanujan graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(18)- Spectral condition for Hamiltonicity of a graph
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonicity of graphs
- Recent advances on the Hamiltonian problem: survey III
- Spectral preorder and perturbations of discrete weighted graphs
- Graph homomorphisms and nodal domains
- Signless Laplacian eigenvalues and circumference of graphs
- Matching number, Hamiltonian graphs and magnetic Laplacian matrices
- Hamilton cycles and eigenvalues of graphs
- Interlacing eigenvalues and graphs
- A geometric construction of isospectral magnetic graphs
- Laplace eigenvalues of graphs---a survey
- Spectral radius and the 2-power of Hamilton paths
- Algebraic conditions for t-tough graphs
- A survey of graph laplacians
- Heuristic search for Hamilton cycles in cubic graphs
- Maximum degree and minimum degree spectral radii of some graph operations
- Spectral radius and Hamiltonian properties of graphs
This page was built for publication: A domain monotonicity theorem for graphs and Hamiltonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192950)