An upper bound of a generalized upper Hamiltonian number of a graph

DOI10.5817/AM2021-5-299MaRDI QIDQ5016011zbMATH OpenFDO

Authors Martin Dzúrik

Publication date 10 December 2021

Published in Archivum Mathematicum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.07652

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graphHamiltonian spectraorderingpseudoorderingupper \(H\)-Hamiltonian numberupper Hamiltonian numberupper traceable numbervertices

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 2109324
• A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1
• Graphs with prescribed order and Hamiltonian number
• scientific article; zbMATH DE number 2077679
• A note on vertex-covering walks

Cited in

(1)

• Combinatorial spectra using polynomials.

This page was built for publication: An upper bound of a generalized upper Hamiltonian number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016011)