245 search results - page 2 / 49 » Group connectivity of graphs with diameter at most 2 |
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
NETWORKS
2002
13 years 4 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
COMBINATORICS
2007
13 years 5 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
COMBINATORICS
2000
13 years 5 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...