Skip to main content
SpringerLink
Log in

An Innovative Combinatorial Approach for the Spanning Tree Entropy in Flower Network

  • Conference paper
  • First Online:
Networked Systems (NETYS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10299))

Included in the following conference series:

Abstract

The spanning tree entropy of a complex network provides a useful insight about its robustness. The most robust network is the network that has the highest entropy. In this paper, we represent construction of a complex network called Flower Network by using two combinatorial approaches: (1) Bipartition and (2) Reduction. We based both methods on geometrical transformation. We also develop topological properties of the network, obtain analytical expression for its number of spanning trees. In the end, we calculate and compare its spanning tree entropy with those for other networks having the same average degree of nodes for estimating a robust network.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cook, A., Zanin, M.: Complex network theory. In: Complexity Science in Air Traffic Management, vol. 9 (2016)

    Google Scholar 

  2. Gao, J., et al.: Robustness of a network of networks. Phys. Rev. Lett. 107(19), 195701 (2011)

    Article  Google Scholar 

  3. Sorkhoh, I., Mahdi, K., Safar, M.: Cyclic entropy of complex networks. In: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE (2012)

    Google Scholar 

  4. Lyons, R.: Asymptotic enumeration of spanning trees. Comb. Probab. Comput. 14(04), 491–522 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Wu, B.Y., Chao, K.-M.: Spanning Trees and Optimization Problems. CRC Press, Boca Raton (2004)

    Book  MATH  Google Scholar 

  6. Kirchhoff, G.: Ueber die Auflsung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Strme gefhrt wird. Annalen der Physik 148(12), 497–508 (1847)

    Article  Google Scholar 

  7. Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197, 143–176 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lin, Y., et al.: Counting spanning trees in self-similar networks by evaluating determinants. J. Math. Phys. 52(11), 113303 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lotfi, D., Marraki, M.E., Aboutajdine, D.: The enumeration of spanning trees in dual, bipartite and reduced graphs. J. Discrete Math. Sci. Crypt. 18(6), 673–687 (2015)

    MathSciNet  Google Scholar 

  10. Zhang, Z., et al.: Mapping Koch curves into scale-free small-world networks. J. Phys. A Math. Theor. 43(39), 395101 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zhang, Z., et al.: The number and degree distribution of spanning trees in the Tower of Hanoi graph. Theor. Comput. Sci. 609, 443–455 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wu, F.Y.: Number of spanning trees on a lattice. J. Phys. A Math. Gen. 10(6), L113 (1977)

    Article  MathSciNet  Google Scholar 

  13. Shrock, R., Fa Yueh, W.: Spanning trees on graphs and lattices in d dimensions. J. Phys. A Math. Gen. 33(21), 3881 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRIT Associated Unit with CNRST (URAC No 29), Faculty of Sciences, Mohammed V University in Rabat, 1014, Rabat, Morocco

    Raihana Mokhlissi, Dounia Lotfi & Mohamed El Marraki

  2. Winona State University, Winona, MN, 55987, USA

    Joyati Debnath

Authors
  1. Raihana Mokhlissi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dounia Lotfi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joyati Debnath
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohamed El Marraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raihana Mokhlissi .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, Santa Barbara, California, USA

    Amr El Abbadi

  2. Université de Lausanne, Lausanne, Switzerland

    Benoît Garbinato

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Mokhlissi, R., Lotfi, D., Debnath, J., El Marraki, M. (2017). An Innovative Combinatorial Approach for the Spanning Tree Entropy in Flower Network. In: El Abbadi, A., Garbinato, B. (eds) Networked Systems. NETYS 2017. Lecture Notes in Computer Science(), vol 10299. Springer, Cham. https://doi.org/10.1007/978-3-319-59647-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59647-1_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59646-4

  • Online ISBN: 978-3-319-59647-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation