Sciweavers

3 search results - page 1 / 1
» Maximal cubic graphs with diameter 4
Sort
View
72
Voted
DAM
2000
78views more  DAM 2000»
14 years 10 months ago
Maximal cubic graphs with diameter 4
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal number of vertices of a (3,4)-graph is 38. ? 2000 Elsevier Science B.V. All rig...
Dominique Buset
71
Voted
DM
2007
136views more  DM 2007»
14 years 10 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
SIAMDM
2010
130views more  SIAMDM 2010»
14 years 8 months ago
On the Hull Number of Triangle-Free Graphs
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
Mitre Costa Dourado, Fábio Protti, Dieter R...