Premium
Extremal graphs of diameter at most 6 after deleting any vertex
Author(s) -
Usami Yoko
Publication year - 1985
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.3190090205
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , induced subgraph , discrete mathematics
Suppose G is a graph of n vertices and diameter at most d having the property that, after deleting any vertex, the resulting subgraph has diameter at most 6. Then G contains at least max{ n , (4 n ‐ 8)/3} edges if 4 ≤ d ≤ 6.
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