Path decompositions of chains and circuits
type: Item
instance of: scholarly article
title: Path decompositions of chains and circuits
zbMATH Open document ID: 0538.05043
DOI: 10.1155/S0161171283000472
author: E. J. Farrell
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1983-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/45373
review text: For each spanning subgraph C of G consisting of paths \(P_ 1,P_ 2,...,P_ k\) let f(i) be the number of vertices in \(P_ i\), and let \(w(C)=\prod^{k}_{i=1}w_{f(i)}\) where \(w_ 1,w_ 2,w_ 3,...\) are indeterminates. The path polynomial of G is \(\sum w(C)\) where the summation is taken over all of the path covers of G. The path polynomials of paths and cycles are derived.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3855152
zbMATH Keywords: path decomposition
zbMATH Keywords: path polynomial
MaRDI profile type: Publication
OpenAlex ID: W2150359458
description: scientific article; zbMATH DE number 3855152