29 search results - page 2 / 6 » Quasi-random graphs with given degree sequences |
CPC
2008
13 years 4 months ago
2008
WAW
2009
Springer
13 years 12 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
DAM
2008
13 years 5 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
JGT
2008
13 years 5 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...