The cycle-path indicator polynomial of a digraph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 1195749 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 1416069 (Why is no real title available?)
- scientific article; zbMATH DE number 3409479 (Why is no real title available?)
- A symmetric function generalization of the chromatic polynomial of a graph
- Location of Zeros of Chromatic and Related Polynomials of Graphs
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
- On the cover polynomial of a digraph
- The partition polynomial of a finite set system
- The path-cycle symmetric function of a digraph
Cited in
(8)- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
- The drop polynomial of a weighted digraph
- The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
- Complexity and approximability of the cover polynomial
- \(\{em,vk\}\)-cyclic path covering number of digraphs
- The Digraph Drop Polynomial
- The path-cycle symmetric function of a digraph
- CUMULANTS IN NONCOMMUTATIVE PROBABILITY THEORY III: CREATION AND ANNIHILATION OPERATORS ON FOCK SPACES
This page was built for publication: The cycle-path indicator polynomial of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585495)