The cycle-path indicator polynomial of a digraph

DOI10.1006/aama.2000.0689zbMath0959.05065OpenAlexW2073560938MaRDI QIDQ1585495

Ottavio M. D'Antona, Emanuele Munarini

Publication date: 16 November 2000

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.2000.0689

zbMATH Keywords

digraphrook polynomialcover polynomialcycle-path covercycle-path indicator polynomial

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

The drop polynomial of a weighted digraph ⋮ Complexity and approximability of the cover polynomial ⋮ CUMULANTS IN NONCOMMUTATIVE PROBABILITY THEORY III: CREATION AND ANNIHILATION OPERATORS ON FOCK SPACES ⋮ The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences ⋮ Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)

Cites Work

• The partition polynomial of a finite set system
• On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
• A symmetric function generalization of the chromatic polynomial of a graph
• On the cover polynomial of a digraph
• The path-cycle symmetric function of a digraph
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The cycle-path indicator polynomial of a digraph