6598 search results - page 176 / 1320 » Graph Theory with Applications |
184
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
133
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
169
click to vote
IPL
2007
15 years 6 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
191
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
157
click to vote
TALG
2008
15 years 6 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in