Forest decompositions of graphs with cyclomatic number 3

E. J. Farrell

International Journal of Mathematics and Mathematical Sciences, 1983, vol. 6, 1-9

Abstract:

The simple tree polynomials of the basic graphs with cyclomatic number 3 are derived. From these results, explicit formulae for the number of decompositions of the graphs into forests with specified cardinalities are extracted. Explicit expressions are also given for the number of spanning forests and spanning trees in the graphs. These results complement the results given in [1].

Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/6/810984.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/6/810984.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:810984

DOI: 10.1155/S0161171283000484

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().