Extremal 2-Connected Graphs with Given Diameter

ENOMOTO, Hikoe; USAMI, Yoko

Tokyo J. of Math., Tome 22 (1999) no. 2, p. 1-16 / Harvested from Project Euclid

Résumé

Suppose $G$ is a 2-connected graph of order $n$ with diameter $d\geq 2$. We prove that \[ |E(G)|\geq\frac{dn-2d-1}{d-1}. \] We also characterize the extremal graphs for $d\geq 5$.

Publié le : 1999-06-15
Classification:

@article{1270041609,
     author = {ENOMOTO, Hikoe and USAMI, Yoko},
     title = {Extremal 2-Connected Graphs with Given Diameter},
     journal = {Tokyo J. of Math.},
     volume = {22},
     number = {2},
     year = {1999},
     pages = { 1-16},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1270041609}
}

ENOMOTO, Hikoe; USAMI, Yoko. Extremal 2-Connected Graphs with Given Diameter. Tokyo J. of Math., Tome 22 (1999) no. 2, pp.  1-16. http://gdmltest.u-ga.fr/item/1270041609/