On square-Hamiltonian graphs

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/423

Full metadata record

DC Field	Value	Language
dc.contributor.author	Protasova, K. D.	-
dc.date.accessioned	2016-02-16T20:37:30Z	-
dc.date.available	2016-02-16T20:37:30Z	-
dc.date.issued	2005	-
dc.identifier.issn	1726-3255	-
dc.identifier.uri	http://hdl.handle.net/123456789/423	-
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
Appears in Collections:	Статті

Files in This Item:

File	Description	Size	Format
adm-n3-5.pdf		103.05 kB	Adobe PDF	View/Open

DSpace JSPUI