473 search results - page 78 / 95 » On stars and Steiner stars |
GC
2008
Springer
13 years 7 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 ...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
Modeling, design and fabrication of tissue scaffolds with intricate architecture, porosity and pore size for desired tissue properties presents a challenge in tissue engineering. ...
DM
2006
13 years 7 months ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
JAL
2006
13 years 7 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
JBI
2006
13 years 7 months ago
2006
Bridging levels of ``granularity'' and ``scale'' are frequently cited as key problems for biomedical informatics. However, detailed accounts of what is meant b...