103 search results - page 2 / 21 » A New Upper Bound on the Total Domination Number of a Graph |
DM
2008
13 years 6 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
DM
2008
13 years 6 months ago
2008
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
JGT
2007
13 years 6 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
COMBINATORICA
2007
13 years 6 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
ISSAC
2007
Springer
14 years 11 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...