НАН РА. Математические вопросы кибернетики и вычислительной техники=Mathematical problems of computer science

Two Generalized Lower Bounds for the Circumference

Koulakzian, Mossine S. and Nikoghosyan, Zhora G. (2018) Two Generalized Lower Bounds for the Circumference. Математические вопросы кибернетики и вычислительной техники, № 49. pp. 18-25. ISSN 0131-4645

[img] PDF
Download (314Kb)

    Abstract

    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 first i smallest degrees in G - C for appropriate i instead of the minimum degree.

    Item Type: Article
    Additional Information: Գրաֆի ամենաերկար ցիկլի երկարության երկու ընդհանրացված գնահատականներ / Մ. Քուլաքզյան, Ժ. Նիկողոսյան: Две обобщенные нижние оценки для длины длиннейшего цикла графа / М. Кулакзян, Ж. Никогосян
    Uncontrolled Keywords: Circumference, Minimum degree, Degree sums.
    Subjects: Q Science > QA Mathematics > Graph theory
    Divisions: UNSPECIFIED
    Depositing User: FSL Bibl. Dept.
    Date Deposited: 22 Oct 2018 12:30
    Last Modified: 22 Oct 2018 12:30
    URI: http://compsci.asj-oa.am/id/eprint/896

    Actions (login required)

    View Item