Two Generalized Lower Bounds for the Circumference
Mathematical Problems of Computer Science · 2018
DOI: 10.51408/1963-0002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Problems of Computer Science, 2018. Verfasst von S. Mossine und 1 weiteren Autor:innen. Die Arbeit nennt 2 Literaturangaben.
Abstract (Originalsprache)
In 2013, the second author obtained two lower bounds for the length of a longest cycle C in a graph G in terms of the length of a longest path (a longest cycle) in G¡C and the minimum degree of G (Zh.G. Nikoghosyan, "Advanced Lower Bounds for the Circumference", Graphs and Combinatorics 29, pp. 1531-1541, 2013). In this paper we present two analogous bounds based on the average of the ¯rst i smallest degrees in G ¡ C for appropriate i instead of the minimum degree
Zitieren
APA
Mossine, S., & Nikoghosyan, Z. (2018). Two Generalized Lower Bounds for the Circumference. Mathematical Problems of Computer Science. https://doi.org/10.51408/1963-0002
Vancouver
Mossine S, Nikoghosyan Z. Two Generalized Lower Bounds for the Circumference. Mathematical Problems of Computer Science. 2018. doi:10.51408/1963-0002
BibTeX
@article{Mossine2018,
author = {Mossine, S. and Nikoghosyan, Zhora},
title = {Two Generalized Lower Bounds for the Circumference},
journal = {Mathematical Problems of Computer Science},
year = {2018},
doi = {10.51408/1963-0002}
}
EUVIMED