Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials

DOI10.1007/BF01788543zbMath0619.05027OpenAlexW1993229752MaRDI QIDQ1089352

Janet Simpson Beissinger, Uri N. Peled

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788543

zbMATH Keywords

generating functionStirling numberslabelled threshold graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items

Total matchings and total coverings of threshold graphs, On degree sequences of undirected, directed, and bidirected graphs, Longest cycles in threshold graphs, Enumeration of difference graphs, Enumerating threshold graphs and some related graph classes, Bipartite bithreshold graphs, The polytope of degree sequences, Enumerative aspects of certain subclasses of perfect graphs, Random walks and hyperplane arrangements, Counting Labeled Threshold Graphs with Eulerian Numbers

Cites Work

• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item