Enumerating threshold graphs and some related graph classes

zbMath1490.05115arXiv2110.08953MaRDI QIDQ5080334

David Galvin, Bailee Zacovic, Greyson Wesley

Publication date: 31 May 2022

Full work available at URL: https://arxiv.org/abs/2110.08953

zbMATH Keywords

threshold graphStirling number of the second kindset partitionEulerian numberquasi-threshold graphloop-threshold graphquasi-loop-threshold graph

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
• Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
• Trivially perfect graphs
• Enumerative aspects of certain subclasses of perfect graphs
• Combinatorics of Permutations
• Counting Labeled Threshold Graphs with Eulerian Numbers
• An Alternate Approach to Alternating Sums: A Method to DIE for
• The Comparability Graph of a Tree
• Proofs from THE BOOK
• Extremal graphs for homomorphisms
• Extremal Graphs for Homomorphisms II

This page was built for publication: Enumerating threshold graphs and some related graph classes