Skip to main content
SpringerLink
Log in

On the number of spanning trees in graphs with multiple edges

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

In order to solve a problem, a usual approach is to represent it in a simple structure and bring it to some particular cases. In graph theory, this approach is used to illustrate this problem by a graph, then treat it on simple sets expressing the relations between its elements. Thus that researchers saw the appearance of spanning trees. The aim of this approach is the evaluation of the number of spanning trees in some networks which can not be find using the existing methods, such as large networks, or with multiple connections. In this paper we focus on graphs with multiple edges and we consider the multi-edges fan and wheel graphs, deriving of exact and recursive functions based on operations and geometric transformations.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Atajan, T., Hiroshi I.: Network reliability analysis by counting the number of spanning trees. In: International Symposiumon Communications and Information Technologies (ISCIT2004 ) Sapporo,Japan (2004)

  2. Aggarwal, K.K., Rai, S.: Reliability evaluation in computer-communication networks. IEEE Trans. Reliab. 1, 32–35 (1981)

    Article  MATH  Google Scholar 

  3. Li, X., Huang, Z.: On the Number of Spanning Trees of Graphs and Applications of Networks. Harbin Institute of Technology Press, New York (1999)

    Google Scholar 

  4. Lemmouchi, S., Haddad, M., Kheddouci, H.: Robustness study of emerged communities from exchanges in peer-to-peer networks. Comput. Commun. 36(10), 1145–1158 (2013)

    Article  Google Scholar 

  5. Sahbani, H., El Marraki, M.: Reliability of the closed-chain-fan social network. In: Ficloud 2015, Rome, Italy, pp. 722–725 (2015)

  6. Takashi, N., Motter, A.E.: Synchronization is optimal in nondiagonalizable networks. Phys. Rev. E 73, 065106(R) (2006)

    Article  Google Scholar 

  7. Marchal, P.: Loop-erased random walks, spanning trees and Hamiltonian cycles. Electron. Commun. Probab. 5, 39–50 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Diestel, R.: Graph Theory. Springer, New York (2000)

    MATH  Google Scholar 

  9. Kirchhoff, G.G.: Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Strme gefhrt wird. Ann. Phys. Chem. 72, 497–508 (1847)

    Article  Google Scholar 

  10. Cayley, A.: A theorem on trees. Quart. J. Math. 23, 376–378 (1889)

    MATH  Google Scholar 

  11. Feussner, W.: Zur Berechnung der Stromsträrke in netzförmigen Letern. Anna. Phys. 13, 1304–1329 (1902)

    Article  MATH  Google Scholar 

  12. Desjarlais, R., Molina, M.: Counting spanning trees in grid graphs. Congr. Numer. 145, 177–185 (2000)

    MathSciNet  MATH  Google Scholar 

  13. Bogdonowicz, Z.: Formulas for the number of spanning trees in a fan. Appl. Math. Sci 2, 781–786 (2008)

    MathSciNet  Google Scholar 

  14. Sahbani, H., El Marraki, M.: Formula for the number of spanning tress in light graph. Appl. Math. Sci. 8(18), 865–874 (2014)

    MathSciNet  Google Scholar 

  15. Haghighi, M.H.S., Bibak, K.: Recursive relations for the number of spanning trees. Appl. Math. Sci 46, 2263–2269 (2009)

    MathSciNet  MATH  Google Scholar 

  16. Boesch, F.T., Prodinger, H.: Spanning tree formulas and Chebyshev polynomials. Graphs Comb 2, 191–200 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Comellas, F., Miralles, A., Hongxiao, L., Zhongzhi, Z.: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. Phys. A 392, 2803–2806 (2013)

    Article  MathSciNet  Google Scholar 

  18. Daoud, S.N.: Generating formulas of the number of spanning trees of some special graphs. Eur. Phys. J. Plus 129(7), 1–14 (2014)

    Article  Google Scholar 

  19. Stavros, D.Nikolopoulos, Papadopoulos, C.: The number of spanning trees in Kn-complements of Quasi-threshold graphs. Graphs and Comb. 20, 383–397 (2004)

    MATH  Google Scholar 

  20. Myers, B.R.: Number of spanning trees in a wheel. IEEE Trans. Circuit Theory CT–18, 280–282 (1971)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Mohammed V University of Rabat, Rabat, Morocco

    Hajar Sahbani & Mohamed El Marraki

Authors
  1. Hajar Sahbani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed El Marraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hajar Sahbani.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sahbani, H., El Marraki, M. On the number of spanning trees in graphs with multiple edges. J. Appl. Math. Comput. 55, 245–255 (2017). https://doi.org/10.1007/s12190-016-1034-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-016-1034-7

Keywords

Mathematics Subject Classification

Search

Navigation