601 search results - page 29 / 121 » Edge-dominating cycles in graphs |
JGT
2006
15 years 1 months ago
2006
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
DM
2010
15 years 2 months ago
2010
For a graph G let
125
click to vote
DM
2008
15 years 2 months ago
2008
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
102
click to vote
GC
2007
Springer
15 years 1 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...