260 search results - page 9 / 52 » Degree constrained subgraphs |
WAW
2009
Springer
15 years 4 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...
JGT
2007
14 years 9 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
DM
2007
14 years 10 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
GD
2005
Springer
15 years 3 months ago
2005
Springer
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...