3008 search results - page 8 / 602 » Independence in connected graphs |
108
click to vote
JCT
2006
15 years 1 months ago
2006
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
117
Voted
JGT
2006
15 years 1 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
122
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
We study properties of multidomain proteins from a graph theoretical perspective. In particular, we demonstrate connections between properties of the domain overlap graph and certa...
99
Voted
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver