Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

On Family of Graphs with Minimum Number of Spanning Trees

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We show that there is a well-defined family of connected simple graphs Λ(n, m) on n vertices and m edges such that all graphs in Λ(n, m) have the same number of spanning trees, and if \({G \in \Lambda(n, m)}\) then the number of spanning trees in G is strictly less than the number of spanning trees in any other connected simple graph \({H, H \notin \Lambda(n, m)}\) , on n vertices and m edges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boesch F.T., Pentingi L., Suffel C.L.: On the characterization of graphs with maximum number of spanning trees. Discret. Math. 179, 155–166 (1998)

    Article  MATH  Google Scholar 

  2. Bogdanowicz Z.R.: Undirected simple connected graphs with minimum number of spanning trees. Discret. Math. 309, 3074–3082 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brown J., Colbourn C., Devitt J.: Network transformations and bounding network reliability. Networks 23, 1–17 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cheng C.S.: Maximizing the total number of spanning trees in a graph Two related problems in graph theory and optimum design theory. J. Combin. Theory Ser. 31, 240–248 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kelmans A.K.: On Graphs with the maximum number of spanning trees. Random Struct. Algorithms 9, 177–192 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kelmans A.K., Chelnokov V.M.: A certain polynomial of a graph and graphs with an extremal number of trees. J. Combin. Theory Ser. 16, 197–214 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mahadev N., Peled V.: Threshold Graphs and Related Topics. Annals of Discrete Mathematics, vol 56. North-Holland, Amsterdam (1995)

    Google Scholar 

  8. Satyanarayana A., Schoppmann L., Suffel C.L.: A reliability-improving graph transformation with applications to network reliability. Networks. 22, 209–216 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Petingi L., Rodriguez J: A new technique for the characterization of graphs with a maximum number of spanning trees. Discret. Math. 244, 351–373 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Armament Research, Development and Engineering Center, Picatinny, NJ, 07806, USA

    Zbigniew R. Bogdanowicz

Authors
  1. Zbigniew R. Bogdanowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zbigniew R. Bogdanowicz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bogdanowicz, Z.R. On Family of Graphs with Minimum Number of Spanning Trees. Graphs and Combinatorics 29, 1647–1652 (2013). https://doi.org/10.1007/s00373-012-1228-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1228-1

Keywords

Search

Navigation