74 search results - page 10 / 15 » arscom 2007 |
ARSCOM
2004
14 years 9 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
ARSCOM
2008
14 years 8 months ago
2008
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
72
Voted
ARSCOM
2005
14 years 9 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
ARSCOM
2004
14 years 9 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
ARSCOM
1998
14 years 9 months ago
1998
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...