On coefficients of circuit polynomials and characteristic polynomials

E. J. Farrell

International Journal of Mathematics and Mathematical Sciences, 1985, vol. 8, 1-9

Abstract:

Results are given from which expressions for the coefficients of the simple circuit polynomial of a graph can be obtained in terms of subgraphs of the graph. From these are deduced parallel results for the coefficients of the characteristic polynomial of a graph. Some specific results are presented on the parities of the coefficients of characteristic polynomials. A characterization is then determined for graphs in which the number of sets of independent edges is always even. This leads to an interesting link between matching polynomials and characteristic polynomials. Finally explicit formulae are derived for the number of ways of covering two well known families of graphs with node disjoint circuits, and for the first few coefficients of their characteristic polynomials.

Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/8/273058.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/8/273058.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:273058

DOI: 10.1155/S0161171285000783

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 ().