Další formáty:
BibTeX
LaTeX
RIS
@article{1800700, author = {Dzúrik, Martin}, article_location = {Brno}, article_number = {5}, doi = {http://dx.doi.org/10.5817/AM2021-5-299}, keywords = {graph; vertices; ordering; pseudoordering; upper Hamiltonian number; upper traceable number; upper H-Hamiltonian number; Hamiltonian spectra}, language = {eng}, issn = {0044-8753}, journal = {Archivum Mathematicum}, title = {An upper bound of a generalized upper Hamiltonian number of a graph}, url = {http://dx.doi.org/10.5817/AM2021-5-299}, volume = {57}, year = {2021} }
TY - JOUR ID - 1800700 AU - Dzúrik, Martin PY - 2021 TI - An upper bound of a generalized upper Hamiltonian number of a graph JF - Archivum Mathematicum VL - 57 IS - 5 SP - 299-311 EP - 299-311 PB - Masarykova univerzita SN - 00448753 KW - graph KW - vertices KW - ordering KW - pseudoordering KW - upper Hamiltonian number KW - upper traceable number KW - upper H-Hamiltonian number KW - Hamiltonian spectra UR - http://dx.doi.org/10.5817/AM2021-5-299 N2 - In this article we study graphs with ordering of vertices, we define a generalization called a pseudoordering, and for a graph H we define the H-Hamiltonian number of a graph G. We will show that this concept is a generalization of both the Hamiltonian number and the traceable number. We will prove equivalent characteristics of an isomorphism of graphs G and H using H-Hamiltonian number of G. Furthermore, we will show that for a fixed number of vertices, each path has a maximal upper H-Hamiltonian number, which is a generalization of the same claim for upper Hamiltonian numbers and upper traceable numbers. Finally we will show that for every connected graph H only paths have maximal H-Hamiltonian number. ER -
DZÚRIK, Martin. An upper bound of a generalized upper Hamiltonian number of a graph. \textit{Archivum Mathematicum}. Brno: Masarykova univerzita, 2021, roč.~57, č.~5, s.~299-311. ISSN~0044-8753. Dostupné z: https://dx.doi.org/10.5817/AM2021-5-299.
|