2503 search results - page 138 / 501 » A study of 3-arc graphs |
143
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
165
click to vote
CCCG
2009
15 years 7 months ago
2009
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
149
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
182
click to vote
DM
2008
15 years 6 months ago
2008
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
175
click to vote
ICDM
2007
IEEE
16 years 25 days ago
2007
IEEE
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...