547 search results - page 81 / 110 » dm 2008 |
129
click to vote
DM
2006
15 years 4 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...
106
click to vote
DM
2006
15 years 4 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...
130
click to vote
DM
2006
15 years 4 months ago
2006
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
133
click to vote
DM
2006
15 years 4 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
104
click to vote
DM
2006
15 years 4 months ago
2006
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...