Counting extensional acyclic digraphs

DOI10.1016/J.IPL.2011.05.014MaRDI QIDQ1944136zbMATH OpenOpenAlexFDO

Authors Alexandru I. Tomescu, Alberto Policriti

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.05.014

zbMATH Keywords

automorphism groupcombinatorial problemsset theorytransitive setrecurrence formulaextensional digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Recommendations

• Ranking, unranking and random generation of extensional acyclic digraphs
• Asymptotic enumeration of extensional acyclic digraphs
• Asymptotic enumeration of extensional acyclic digraphs
• On the number of labeled acyclic digraphs
• Counting acyclic and strong digraphs by descents

Cites work

• scientific article; zbMATH DE number 42735 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3627183 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3348134 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Acyclic orientations and the chromatic polynomial
• Acyclic orientations of graphs
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• Counting acyclic digraphs by sources and sinks
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Exact enumeration of acyclic deterministic automata
• The Number of Full Sets with n Elements
• The On-Line Encyclopedia of Integer Sequences
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Well-quasi-ordering hereditarily finite sets

Cited in

(10)

• Set graphs. IV. Further connections with claw-freeness
• Ordinal operations on graph representations of sets
• Multiplicativity of acyclic digraphs
• Ranking, unranking and random generation of extensional acyclic digraphs
• Digraph parameters and finite set arithmetic
• Random generation of essential directed acyclic graphs
• Counting acyclic hypergraphs
• Asymptotic enumeration of extensional acyclic digraphs
• Counting acyclic and strong digraphs by descents
• Asymptotic enumeration of extensional acyclic digraphs

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting extensional acyclic digraphs

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