87 search results - page 12 / 18 » dm 2002 |
DM
2002
14 years 9 months ago
2002
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
DM
2002
14 years 9 months ago
2002
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2,
DM
2002
14 years 9 months ago
2002
An approach to the computations of upper bounds on the size of large complete arcs is presented. In particular, we obtain geometrical properties of irreducible envelopes associated...
DM
2006
14 years 9 months ago
2006
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
DM
2006
14 years 9 months ago
2006
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...