A graph G is diameter 2-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter 2-critical graph of order n is at most n2/4 and that the extremal graphs are complete bipartite graphs with equal size partite sets. We use an important association with total domination to prove the conjecture for the graphs whose complements have vertex connectivity k for k∈1,2,3.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-17276 |
| Date | 28 January 2012 |
| Creators | Haynes, Teresa W., Henning, Michael A., Yeo, Anders |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0019 seconds