Notes on Hamiltonian threshold and chain graphs
From MaRDI portal
Abstract: We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained. We present these results in new forms, now stated in terms of structural parameters that uniquely define the threshold graph and we extend them to chain graphs. We also identify the chain graph with minimum number of Hamilton cycles within the class of Hamiltonian chain graphs of a given order.
Recommendations
Cites work
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Hamiltonian threshold graphs
- Laplacian controllability for graphs with integral Laplacian spectrum
- On Hamiltonian bipartite graphs
- The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order
- Threshold graphs and related topics
Cited in
(6)
This page was built for publication: Notes on Hamiltonian threshold and chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133251)