Ara es mostren els items 1-1 de 1

• #### On the connectivity and superconnected graphs with small diameter ﻿

(2010-03-06)
Article
Accés restringit per política de l'editorial
In this paper, first we prove that any graph G is 2-connected if diam (G)≤ g-1 for even girth g, and for odd girth g and maximum degree $\Delta$ ≤ 2$\delta$-1 where $\delta$ is the minimum degree. Moreover, we prove that ...