5 search results - page 1 / 1 » The roots of the independence polynomial of a clawfree graph |
48
Voted
JCT
2007
15 years 17 days ago
2007
88
Voted
SIAMDM
2008
15 years 18 days ago
2008
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
125
click to vote
TON
2012
13 years 3 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
107
click to vote
DAM
2007
15 years 20 days ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
102
Voted
ICALP
2009
Springer
16 years 29 days ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...