On coefficients of path polynomials

E. J. Farrell

International Journal of Mathematics and Mathematical Sciences, 1984, vol. 7, 1-9

Abstract:

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 .

Date: 1984
References: Add references at CitEc
Citations:

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

DOI: 10.1155/S0161171284000065

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