Hamiltonian properties in generalized lexicographic products

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F25%3A43969815" target="_blank" >RIV/49777513:23520/25:43969815 - isvavai.cz</a>
Result on the web
<a href="https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2527" target="_blank" >https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2527</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.7151/dmgt.2527" target="_blank" >10.7151/dmgt.2527</a>

Result language
angličtina
Original language name
Hamiltonian properties in generalized lexicographic products
Original language description
The lexicographic product G[H] of two graphs G and H is obtained from G by replacing each vertex with a copy of H and adding all edges between any pair of copies corresponding to adjacent vertices of G. We consider also the generalized lexicographic product such that we replace each vertex of G with arbitrary graph on the same number of vertices. We present sufficient and necessary conditions for traceability, hamiltonicity and hamiltonian connectivity of G[H] if G is a path and hence we improved and extended results in [M. Kriesell, A note on Hamiltonian cycles in lexicographical products, J. Autom. Lang. Comb. 2 (1997) 135–138].
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

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)