Counting Labeled Threshold Graphs with Eulerian Numbers

zbMath1444.05069arXiv1909.06518MaRDI QIDQ3300701

Sam Spiro

Publication date: 29 July 2020

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

zbMATH Keywords

exponential generating functionthreshold pair

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

A combinatorial statistic for labeled threshold graphs ⋮ Counting regions of the boxed threshold arrangement ⋮ Enumerating threshold graphs and some related graph classes

Cites Work

• Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
• Threshold graphs and related topics
• Ballot permutations and odd order permutations
• Threshold Graph Limits and Random Threshold Graphs
• Oriented Threshold Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting Labeled Threshold Graphs with Eulerian Numbers