3008 search results - page 73 / 602 » Independence in connected graphs |
89
Voted
ENDM
2007
15 years 23 days ago
2007
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
98
Voted
COMBINATORICS
2004
15 years 20 days ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
110
Voted
TPDS
2010
14 years 11 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
109
Voted
DM
2002
15 years 18 days ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
103
click to vote
CORR
2006
Springer
15 years 25 days ago
2006
Springer
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...