Sciweavers

601 search results - page 29 / 121
» Edge-dominating cycles in graphs
Sort
View
JGT
2006
95views more  JGT 2006»
13 years 10 months ago
Maximal independent sets in graphs with at most r cycles
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...
Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vinc...
DM
2010
83views more  DM 2010»
13 years 10 months ago
Packing edge-disjoint cycles in graphs and the cyclomatic number
For a graph G let
Jochen Harant, Dieter Rautenbach, Peter Recht, Fri...
DM
2008
68views more  DM 2008»
13 years 10 months ago
Heavy cycles in k-connected weighted graphs with large weighted degree sums
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...
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
GC
2007
Springer
13 years 10 months ago
Consistent Cycles in Graphs and Digraphs
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...
Stefko Miklavic, Primoz Potocnik, Steve Wilson