Premium
Pancyclic oriented graphs
Author(s) -
Song Zeng Min
Publication year - 1994
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.3190180504
Subject(s) - combinatorics , mathematics , graph , pancyclic graph , discrete mathematics , order (exchange) , 1 planar graph , line graph , finance , economics
Let D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v , either uv ≅ A(D) , or d D + ( u ) + d D − ( v ) ≧ n − 3.
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