Get access

The number of spanning trees in an (r, s)-semiregular graph and its line graph

Authors

  • Khodakhast Bibak

    Corresponding author
    1. Department of Combinatorics and Optimization, University of Waterloo Waterloo, Ontario, Canada N2L 3G1
    • Department of Combinatorics and Optimization, University of Waterloos Waterloo, Ontario, Canada N2L 3G1
    Search for more papers by this author

Abstract

For a graph G, a “spanning tree” in G is a tree that has the same vertex set as G. The number of spanning trees in a graph (network) G, denoted by t(G), is an important invariant of the graph (network) with lots of decisive applications in many disciplines. In the article by Sato (Discrete Math. 2007, 307, 237), the number of spanning trees in an (r, s)-semiregular graph and its line graph are obtained. In this article, we give short proofs for the formulas without using zeta functions. Furthermore, by applying the formula that enumerates the number of spanning trees in the line graph of an (r, s)-semiregular graph, we give a new proof of Cayley's Theorem. © 2013 Wiley Periodicals, Inc.

Get access to the full text of this article

Ancillary