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

DOI10.1007/BF01788543zbMATH Open0619.05027OpenAlexW1993229752MaRDI QIDQ1089352FDOQ1089352

Authors: 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

Recommendations

• Enumerating threshold graphs and some related graph classes
• Counting Labeled Threshold Graphs with Eulerian Numbers
• A combinatorial statistic for labeled threshold graphs
• Oriented threshold graphs
• Note on chromatic polynomials of the threshold graphs

zbMATH Keywords

generating functionStirling numberslabelled threshold graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Über die Bernoullischen Zahlen und die Eulerschen Polynome
• Title not available (Why is that?)
• Asymptotic Methods in Enumeration
• Title not available (Why is that?)

Cited In (11)

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

This page was built for publication: Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089352)