Determination of Hamiltonian Circuit and Euler Trail from a Given Graphic Degree Sequence

Please use this identifier to cite or link to this item: https://ir.vidyasagar.ac.in/jspui/handle/123456789/749

Full metadata record

DC Field	Value	Language
dc.contributor.author	Basuli, Krishnendu
dc.contributor.author	Naskar, Saptarshi
dc.contributor.author	Sarma, Samar Sen
dc.date.accessioned	2016-12-22T17:09:11Z	-
dc.date.available	2016-12-22T17:09:11Z	-
dc.date.issued	2008
dc.identifier.issn	0972-8791 (Print)
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/749	-
dc.description	249-252	en_US
dc.description.abstract	A sequence of nonnegative integers can represent degrees of a graph. Already there is an established condition under which the above conclusion is true. It is our objective in this paper to show that a similar degree sequence represents degrees of vertices of a graph having Hamiltonian Circuit or Euler Tour. The only fallacy of the conclusion is that there may be graphs those are not Hamiltonian or Euler graphs may have the same degree sequence.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;Vol 12 [2008]
dc.subject	Hamiltonian Circuit	en_US
dc.subject	Euler Trail	en_US
dc.subject	Graphic Sequence	en_US
dc.subject	Spanning Subgraph	en_US
dc.title	Determination of Hamiltonian Circuit and Euler Trail from a Given Graphic Degree Sequence	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.12 [2008]

Files in This Item:

File	Description	Size	Format
JPS12-23.pdf		150.32 kB	Adobe PDF	View/Open