An upper bound of a generalized upper Hamiltonian number of a graph
Martin Dzúrik (2021)
Archivum Mathematicum
Similarity:
In this article we study graphs with ordering of vertices, we define a generalization called a pseudoordering, and for a graph we define the -Hamiltonian number of a graph . 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 and using -Hamiltonian number of . Furthermore, we will show that for a fixed number of vertices, each path has a maximal upper...