Sciweavers

534 search results - page 7 / 107
» Diameter critical graphs
Sort
View
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
13 years 9 months ago
Random Geometric Graph Diameter in the Unit Ball
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...
WG
2009
Springer
14 years 2 months ago
Cycles, Paths, Connectivity and Diameter in Distance Graphs
Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz ...
CATS
2008
13 years 11 months ago
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
Using eigenvalue analysis, it was shown by Erd
Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-...
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
13 years 11 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...