3008 search results - page 95 / 602 » Independence in connected graphs |
133
click to vote
DM
1998
15 years 6 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
142
click to vote
WG
2007
Springer
16 years 13 days ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
133
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper investigates string stability issues in homogeneous strings of strictly proper feedback control systems with unidirectional nearest neighbour communications, using o...
190
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
162
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...