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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F21%3A00122701" target="_blank" >RIV/00216224:14310/21:00122701 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.5817/AM2021-5-299" target="_blank" >http://dx.doi.org/10.5817/AM2021-5-299</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5817/AM2021-5-299" target="_blank" >10.5817/AM2021-5-299</a>

Result language
angličtina
Original language name
An upper bound of a generalized upper Hamiltonian number of a graph
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)