Journal ArticleDOI
Comment on "General Solution to the Spanning Tree Enumeration Problem in Multigraph Wheels
D. Johnson,J. Johnson +1 more
About:
This article is published in IEEE Transactions on Circuit Theory.The article was published on 1973-07-01. It has received 5 citations till now. The article focuses on the topics: Spanning tree & Minimum spanning tree.read more
Citations
More filters
Journal ArticleDOI
General solution to the spanning tree enumeration problem in arbitrary multigraph joins
TL;DR: In this paper, the number of spanning trees in an arbitrary graph or multigraph is obtained via a general formula involving eigenvalues of an associated matrix, and a method for deriving the appropriate eigenvaiues of joins is given.
Journal ArticleDOI
Spanning tree enumeration by bipartite subgraph separation
TL;DR: In this article, enumerating functions which greatly facilitate counting the spanning trees of certain classes of graphs are presented, with examples of their application, and they give the spanning tree count in terms of the spanning forests of the subgraph which results on separating, from the original ordinary graph G, the complete bipartite subgraph defined by the incidence set of any one of its vertices.
Journal ArticleDOI
Comments on 'General expressions for network complexity of selected families of graphs'
J. Johnson,D. Johnson +1 more
Journal ArticleDOI
Letters to the editor on the number of trees in a ladder graph
Journal ArticleDOI
On Enumerating the Trees of the Wheel and Other Special Graphs
TL;DR: The procedure is a generalization of a known method of enumerating the trees of a suitably labeled ladder graph, and results in a direct listing of the trees with no duplications and no extraneous subgraphs.
References
More filters
Journal ArticleDOI
On Hypergeometric Functions in Iterated Networks
TL;DR: In this paper, the Jacobi-Chebyshev polynomials and another hypergeometric function are used to analyze passive iterated networks, and expressions for iterated network functions are derived in terms of this class of functions.
Journal ArticleDOI
General solution to the spanning tree enumeration problem in multigraph wheels
N. Bose,Rodolfo Feick,F. Sun +2 more
TL;DR: In this paper, a recurrence relation and an explicit solution for the number of spanning trees in a multigraph wheel with unequal numbers of spokes and rim edges are given, which can be identified as special cases of the general enumeration.