Sciweavers

1729 search results - page 12 / 346
» On Bounds for the k-Partitioning of Graphs
Sort
View
EJC
2011
14 years 4 months ago
Matching and edge-connectivity in regular graphs
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
Suil O, Douglas B. West
COMBINATORICA
1998
77views more  COMBINATORICA 1998»
14 years 9 months ago
A Bound on the Total Chromatic Number
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...
Michael Molloy, Bruce A. Reed
FOCS
2010
IEEE
14 years 7 months ago
Distance Oracles beyond the Thorup-Zwick Bound
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...
Mihai Patrascu, Liam Roditty
DM
2002
116views more  DM 2002»
14 years 9 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
CORR
2007
Springer
126views Education» more  CORR 2007»
14 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