3204 search results - page 332 / 641 » The Alcuin Number of a Graph |
173
click to vote
DM
2008
15 years 6 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
187
click to vote
DM
2006
15 years 6 months ago
2006
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...
128
click to vote
JGT
2006
15 years 6 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
158
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
191
click to vote
DM
2008
15 years 6 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...