3008 search results - page 143 / 602 » Independence in connected graphs |
187
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
160
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
171
click to vote
GC
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
177
click to vote
JGAA
2008
15 years 6 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...