![](/images/graphics-bg.png)
Graph Invariants and Large Cycles : A Survey
Author
Source
International Journal of Mathematics and Mathematical Sciences
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-11, 11 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-05-14
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
Graph invariants provide a powerful analytical tool for investigation of abstract substructures of graphs.
This paper is devoted to large cycle substructures, namely, Hamilton, longest and dominating cycles and some generalized cycles including Hamilton and dominating cycles as special cases.
In this paper, we have collected 36 pure algebraic relations between basic (initial) graph invariants ensuring the existence of a certain type of large cycles.
These simplest kind of relations having no forerunners in the area actually form a source from which nearly all possible hamiltonian results (including well-known Ore's theorem, Posa's theorem, and many other generalizations) can be developed further by various additional new ideas, generalizations, extensions, restrictions, and structural limitations.
American Psychological Association (APA)
Nikoghosyan, Zh. G.. 2011. Graph Invariants and Large Cycles : A Survey. International Journal of Mathematics and Mathematical Sciences،Vol. 2011, no. 2011, pp.1-11.
https://search.emarefa.net/detail/BIM-454451
Modern Language Association (MLA)
Nikoghosyan, Zh. G.. Graph Invariants and Large Cycles : A Survey. International Journal of Mathematics and Mathematical Sciences No. 2011 (2011), pp.1-11.
https://search.emarefa.net/detail/BIM-454451
American Medical Association (AMA)
Nikoghosyan, Zh. G.. Graph Invariants and Large Cycles : A Survey. International Journal of Mathematics and Mathematical Sciences. 2011. Vol. 2011, no. 2011, pp.1-11.
https://search.emarefa.net/detail/BIM-454451
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-454451