Sciweavers

601 search results - page 11 / 121
» Edge-dominating cycles in graphs
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 9 months ago
Network synchronizability analysis: the theory of subgraphs and complementary graphs
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
Zhisheng Duan, Chao Liu, Guanrong Chen

Book
1174views
15 years 7 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
12 years 7 days ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
DM
2002
104views more  DM 2002»
13 years 9 months ago
4-connected maximal planar graphs are 4-ordered
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
Wayne Goddard

Book
1197views
15 years 7 months ago
Graph Theory with Applications
A classic book on graph theory.
J.A. Bondy and U.S.R. Murty