3268 search results - page 69 / 654 » The hub number of a graph |
139
click to vote
DAM
2010
15 years 6 months ago
2010
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
149
click to vote
DAM
2008
15 years 6 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
176
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
155
click to vote
DAM
2008
15 years 6 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
170
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...