The drop polynomial of a weighted digraph

DOI10.1016/j.jctb.2017.04.003zbMath1368.05072OpenAlexW2606589498MaRDI QIDQ2399350

Ronald L. Graham, Fan R. K. Chung

Publication date: 22 August 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2017.04.003

zbMATH Keywords

Tutte polynomialbinomial drop polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matrix cover polynomial
• Rook theory and cycle-counting permutation statistics
• Rook theory. III: Rook polynomials and the chromatic structure of graphs
• A note on the binomial drop polynomial of a poset
• Factorization of the cover polynomial
• Generalized rook polynomials
• The cycle-path indicator polynomial of a digraph
• Further investigation involving rook polynomials with only real zeros
• The vertex-cover polynomial of a graph
• A symmetric function generalization of the chromatic polynomial of a graph
• Contraction-deletion invariants for graphs
• On the cover polynomial of a digraph
• The path-cycle symmetric function of a digraph
• Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function
• Acyclic orientations of graphs
• Juggling Drops and Descents
• On the computational complexity of the Jones and Tutte polynomials
• Complexity of the Cover Polynomial