1605 search results - page 18 / 321 » On Partitional Labelings of Graphs |
110
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
94
Voted
ARSCOM
2007
15 years 3 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
144
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
110
Voted
ASYNC
1998
IEEE
15 years 8 months ago
1998
IEEE
We present the XDI Model for specifying delay-insensitive circuits, that is, reactive systems that correctly exchange signals with their environment in spite of unknown delays inc...
134
Voted
ENTCS
2002
15 years 3 months ago
2002
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...