Skip to main content
SpringerLink
Log in
Book cover

Image Processing and Communications Challenges 4 pp 283–290Cite as

Spanning Trees Structures of Communications Networks

  • Conference paper

  • 2303 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 184))

Summary

Graph theory provides a technique for disabling redundant links of a network in order to avoid the switching loop problem. In this paper, we investigate the use of the duality algebraic criteria to find the spanning trees of some switched planar networks. Based on recursive functions, we give new methods that enumerate the spanning trees of some dual graphs. Our theoretical approach guaranties both simplicity and efficiency when compared with the existing approaches and considering the grid network as an application.

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lotfi, D., El Marraki, M., Modabish, A.: Recursive relation for counting the complexity of butterfly map. Journal of Theoretical and Applied Information Technology 21(1), 43–46 (2011)

    Google Scholar 

  2. Lotfi, D., El Marraki, M., Aboutajdine, D.: Spanning tree recursions for crosses maps. Journal of Theoretical and Applied Information Technology 31(1), 1–7 (2011)

    Google Scholar 

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

    Article  Google Scholar 

  4. Modabish, A., Lotfi, D., El Marraki, M.: The number of spanning trees of planar maps: theory and applications. In: Proceeding of the International Conference on Multimedia Computing and Systems IEEE, ICMCS 2011, Ouarzazate, Morocco, pp. 1–6 (2011)

    Google Scholar 

  5. Modabish, A., El Marraki, M.: The number of spanning trees of certain families of planar maps. Applied Mathematical Sciences 5(18), 883–898 (2011)

    MathSciNet  MATH  Google Scholar 

  6. Haghighi, M.H.S., Bibak, K.: Recursive relations for the number of spanning trees. Applied Mathematical Sciences 3(46), 2263–2269 (2009)

    MathSciNet  MATH  Google Scholar 

  7. Bogdanowicz, Z.R.: Formulas for the number of spanning trees in a fan. Applied Mathematical Sciences 2(16), 781–786 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Nishizeki, T., Saidur, R.M.: Planar Graph Drawing. Lecture Note Series on Computing, vol. 12. World Scientific Publishing Co. Pte. Ltd, Singapore (2004)

    MATH  Google Scholar 

  9. Desjarlais, M., Molina, R.: Counting spanning trees in grid graphs. Congressus Numerantium 145, 177–185 (2000)

    MathSciNet  MATH  Google Scholar 

  10. Kirchhoff, G.: Über die auflösung der gleichungen auf. Welche man bei der Untersuchung der Linearen Verteilung Galvanischer Ströme geführt Wird. Ann. Phy. Chem. 72, 497–508 (1847)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRIT Associated Unit with CNRST (URAC29), Faculty of Sciences, Mohammed V University, Agdal, B.P.1014 RP, Rabat, Morocco

    Dounia Lotfi, Mohamed El Marraki & Driss Aboutajdine

Authors
  1. Dounia Lotfi
    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

  3. Driss Aboutajdine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dounia Lotfi .

Editor information

Editors and Affiliations

  1. , Institute of Telecommunications, University of Technology & Life Sciences, ul.S.Kaliskiego 7, Bydgoszcz, 85-791, Poland

    Ryszard S. Choraś

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lotfi, D., El Marraki, M., Aboutajdine, D. (2013). Spanning Trees Structures of Communications Networks. In: Choraś, R. (eds) Image Processing and Communications Challenges 4. Advances in Intelligent Systems and Computing, vol 184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32384-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32384-3_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32383-6

  • Online ISBN: 978-3-642-32384-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation