Advanced search
Publication Cover
Journal of Discrete Mathematical Sciences and Cryptography Volume 18, 2015 - Issue 6
Journal homepage
37
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs

Dounia LotfiLRIT Associated Unit to CNRST (URAC N o 29) Faculty of Sciences, University of Mohammed V-Agdal B.P.1014 RP, Rabat, MoroccoCorrespondence[email protected]
,
Mohamed El MarrakiLRIT Associated Unit to CNRST (URAC N o 29) Faculty of Sciences, University of Mohammed V-Agdal B.P.1014 RP, Rabat, Morocco
&
Driss AboutajdineLRIT Associated Unit to CNRST (URAC N o 29) Faculty of Sciences, University of Mohammed V-Agdal B.P.1014 RP, Rabat, Morocco
Pages 673-687 | Received 01 Aug 2013, Published online: 16 Dec 2015

References

  • G. Baron, H. Prodinger, F. Tichy Boesch and J. Wang, The number of spanning trees in the square of a cycle, The Fibonacci Quarterly 23 (1985), 258–264.
  • J.C. Bermond, F. Comellas and D.F. Hsu, Distributed loop computer networks: A survey, J. Parallel Distrib. Comput. 24 (1995).
  • N. Biggs, Spanning trees of dual graphs, Journal of Combin.Theory, Series B, 11 (1971), 127–131.
  • F.T. Boesch, H. Prodinger, Spanning tree formulae and Chebyshev polynomials, Graph Combin. 2 (1986), 191–200
  • B. Bollobas, Modern Graph Theory, Springer, New York, 1998.
  • A. Cayley, A theorem on trees, Quart. J. Math. 23 (1889), 376–378.
  • X. Chen, Q. Lin and F. Zhang, The number of spanning trees in odd valent circulant graphs, Discrete Math. 282 (2004), 69–79.
  • D. Cvetkovie, M. Doob and H. Sachs, Spectra of Graphs: Theory and Applications, 3rd edition, Johann Ambrosius Barth, Heidelberg, 1995.
  • P. Erdos and D.F. Hsu, Distributed loop networks with minimum transmission delay, Theoret. Comput. Sci. 100 (1992), 223–241.
  • M.H.S. Haghighi and K. Bibak, Recursive relations for the number of spanning trees, Applied Mathematical Sciences. 46 (2009), 2263–2269.
  • G. Kirchhoff, Uber die Auosung der Gleichungen auf, welche man bei der Untersuchung der linearen Verteilung galvanischer Strome gefuhrt wird, Ann. Phy. Chem., 72 (1847) 497–508.
  • A. Modabish, D. Lotfi and M. El Marraki, “The number of spanning trees of planarmaps: theory and applications”, Selected Topics in Proceeding of the International Conference on Multimedia Computing and Systems IEEE, ICMCS'11, Ouarzazate, Morocco (2011), pp. 1–6.
  • S.D. Nikolopoulos and C. Papadopoulos, The number of spanning trees in Kn-complements of quasi-threshold graphs, Graphs Combin. 20 (2004), 383–397.
  • T. Nishizeki and Md. Saidur Rahman, Planar Graph Drawing, Lecture Note Series on Computing, 12. World Scientific Publishing, ctSingapore, 2004.
  • R. Stanley, Enumerative Combinatorics, Vol. 2., Cambridge University Press, Cambridge, 1999.
  • D.B. West, Introduction to graph theory, Second Edition, University of Illinois – Urbana, 2002.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.