On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs

E. J. Farrell

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

Abstract:

Let G be a graph. With every path α of G let us associate a weight w α With every spanning subgraph C of G consisting of paths α 1 , α 2 , … , α k , let us associate the weight w ( C ) = ∏ i = 1 k w α i . The path polynomial of G is ∑ w ( C ) , where the summation is taken over all the spanning subgraphs of G whose components are paths. Some basic properties of these polynomials are given. The polynomials are then used to obtain results about the minimum number of node disjoint path coverings in graphs.

Date: 1983
References: Add references at CitEc
Citations:

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

DOI: 10.1155/S0161171283000617

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