Show simple item record Protasova, K. D. 2016-02-16T20:37:30Z 2016-02-16T20:37:30Z 2005
dc.identifier.issn 1726-3255
dc.description On square-Hamiltonian graphs / K. D. Protasova // Algebra and Discrete Mathematics. - 2005. - № 3. - 56-59. uk_UA
dc.description.abstract A finite connected graph G is called square-Hamiltonian if G2 is Hamiltonian. We prove that any join of the family of Hamiltonian graphs by tree is square-Hamiltonian. Applying this statement we show that the line graph and any round-about reconstruction of an arbitrary finite connected graph is square-Hamiltonian. uk_UA
dc.language.iso en uk_UA
dc.publisher ДЗ "Луганський національний університет імені Тараса Шевченка uk_UA
dc.subject алгебра uk_UA
dc.title On square-Hamiltonian graphs uk_UA
dc.type Article uk_UA

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account