On coefficients of path polynomials
Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes. Also simplified expressions are given for the number...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1984-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171284000065 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes. Also simplified expressions are given for the number of ways of covering the nodes of some families of graphs with k paths, for certain values of k. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |