On coefficients of circuit polynomials and characteristic polynomials
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1985-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171285000783 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |