Premium
Circumference and girth
Author(s) -
Zhang CunQuan
Publication year - 1989
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190130409
Subject(s) - combinatorics , mathematics , circumference , girth (graph theory) , graph , geometry
Let G be 2‐connected graph with girth g and minimum degree d . Then each pair of vertices of G is joined by a path of length at least max{1/2( d − 1) g , ( d − 3/2)( g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[( d − 1)( g − 2) + 2], [(2 d − 3)( g − 4) + 4]}.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom