Name
Abstract | ||
|---|---|---|
A graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge increased its diameter. We prove that if G is diameter 2-critical graph on n vertices and e edges, then (i) e⩽[ 1 4 n 2 ] for n⩽24, and (ii) e< 1 4 n 2 + (n 2 - 16.2n + 56)/320 (<0.2532 n 2 ), for n ⩾25 . |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0012-365X(87)90174-9 | Discrete Mathematics |
Keywords | Field | DocType |
diameter 2-critical graph | Graph theory,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Mathematics,Critical graph | Journal |
Volume | Issue | ISSN |
67 | 3 | Discrete Mathematics |
Citations | PageRank | References |
20 | 3.58 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genghua Fan | 1 | 412 | 65.22 |