Möbius Inversion of Random Acyclic Directed Graphs

DOI10.1002/SAPM19918411zbMATH Open0716.05024OpenAlexW2299664617MaRDI QIDQ3203047FDOQ3203047

Joel E. Cohen

Publication date: 1991

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm19918411

Recommendations

• Notions of Möbius inversion
• Random Generation of Directed Acyclic Graphs
• Graded posets inverse zeta matrix formula. IIB. The formula of inverse \(\zeta\)-matrix for graded posets with the finite set of minimal elements via natural join of matrices and digraph techniques -- B. Weighted reflexive reachability relation
• On the singularity of adjacency matrices for random regular digraphs
• Möbius function for the set of acyclic directed backbone graphs.

zbMATH Keywords

adjacency matrixzeta matrixMöbius inverserandom acyclic digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Theory of matrix inversion and generalized inverses (15A09)

Cites Work

• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Title not available (Why is that?)

Cited In (1)

• Möbius function for the set of acyclic directed backbone graphs.

This page was built for publication: Möbius Inversion of Random Acyclic Directed Graphs

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