Object

Title: Two Generalized Lower Bounds for the Circumference

Co-author(s) :

Nikoghosyan Zhora

Abstract:

Two lower bounds for the circumference (the length of a longest cycle C in a graph G) are presented in terms of a longest path (a longest cycle) in G-C and the average of the first i smallest degrees in G. As immediate corollaries, we obtain the original lower bounds for the circumference in terms of G-C structures and the minimum degree of G (Zh.G. Nikoghosyan, “Advanced Lower Bounds for the Circumference”, Graphs and Combinatorics 29, pp. 1531- 1541, 2013).

Identifier:

oai:noad.sci.am:135778

Language:

English

URL:

click here to follow the link

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Year:

2017

Time period:

September25-29

Conference title:

11th International Conference on Computer Science and Information Technologies CSIT 2017

Place:

Yerevan

Participation type:

oral

Object collections:

Last modified:

Mar 3, 2021

In our library since:

Jul 15, 2020

Number of object content hits:

5

All available object's versions:

https://noad.sci.am/publication/149305

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information