10 search results - page 1 / 2 » Enumeration for spanning forests of complete bipartite graph... |
51
Voted
ARSCOM
2004
14 years 10 months ago
2004
91
Voted
ARSCOM
2007
14 years 10 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
92
Voted
DM
2002
14 years 10 months ago
2002
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...
99
Voted
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
76
Voted
CPC
1998
14 years 9 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...