Degree Sequences and Dominating Cycles in 2-Connected Graphs

Mossine S.  Koulakzyan

doi:10.51408/1963-0004

Degree Sequences and Dominating Cycles in 2-Connected Graphs

Authors

Mossine S. Koulakzyan Institute for Informatics and Automation Problems of NAS RA

DOI:

https://doi.org/10.51408/1963-0004

Keywords:

Hamilton cycle, dominating cycle, circumference, degree sequence

Abstract

References

J. A .Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York 1976.

G. A.Dirac, Some theorems on abstract graphs", Proc. London, Math. Soc., vol.2, pp. 69-81,1952.

Zh. G. Nikoghosyan, Degree sequences and long cycles in Graphs" , ArX iv:1711.04134 (2017) 9 pages.

K. Ozeki and T. Yamashita, Length of longest cycles in a graph whose relative length is at least two", Graphs and Combin., vol. 28, pp. 859-868, 2012.

Downloads

Published

2021-12-10

How to Cite

Koulakzyan, M. S. (2021). Degree Sequences and Dominating Cycles in 2-Connected Graphs. Mathematical Problems of Computer Science, 49, 35–40. https://doi.org/10.51408/1963-0004