1395 search results - page 44 / 279 » (k, )-Distance-Hereditary Graphs |
ARSCOM
2007
13 years 10 months ago
2007
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
DM
2002
13 years 9 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider cubic graphs formed with k 2 disjoint claws Ci K1,3 (0 i k-1) such that for every integer i modulo k the three vertices of degree 1 of Ci are joined to the three v...
DM
1999
13 years 9 months ago
1999
Let G be a simple graph with n( 2) vertices, and i(G) be the ith largest eigenvalue of G. In this paper we obtain the following: If 3(G) < 0, and there exists some index k, 2 ...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
