1395 search results - page 126 / 279 » (k, )-Distance-Hereditary Graphs |
118
click to vote
COMBINATORICS
2006
14 years 10 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
GC
2007
Springer
14 years 10 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
RSA
2010
14 years 8 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
WDAG
2007
Springer
15 years 4 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...