120 search results - page 17 / 24 » dm 2006 |
DM
2006
14 years 9 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
DM
2006
14 years 9 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
DM
2006
14 years 9 months ago
2006
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perfect matchings being adjacent13 if their symmetric difference forms the edge set...
51
Voted
DM
2006
14 years 9 months ago
2006
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
76
Voted
DM
2006
14 years 9 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...