Path decompositions of chains and circuits
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 3959470
- On coefficients of path polynomials
- On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
- scientific article; zbMATH DE number 4087710
- scientific article; zbMATH DE number 3931061
Cited in
(12)- The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
- On coefficients of path polynomials
- New results on path-decompositions and their down-links
- scientific article; zbMATH DE number 4160782 (Why is no real title available?)
- scientific article; zbMATH DE number 3959470 (Why is no real title available?)
- scientific article; zbMATH DE number 4077268 (Why is no real title available?)
- Path polynomials of a circuit: a constructive approach
- scientific article; zbMATH DE number 1744076 (Why is no real title available?)
- Higher-order matching polynomials and \(d\)-orthogonality
- scientific article; zbMATH DE number 5239159 (Why is no real title available?)
- On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
- Paths algebra, similarities and system decomposition
This page was built for publication: Path decompositions of chains and circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793050)
