15 search results - page 1 / 3 » Distance-two labelings of digraphs |
DM
2006
13 years 8 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...
EJC
2007
13 years 8 months ago
2007
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
DAM
2007
13 years 8 months ago
2007
EJC
2008
13 years 8 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...