On the number of edges in the transitive closure of a graph

DOI10.1016/0166-218X(86)90020-XzbMath0601.05026OpenAlexW1978042226MaRDI QIDQ1080862

Kohei Noshita, William F. McColl

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90020-x

zbMATH Keywords

partitions of integersnumber of edgestransitive closure of a graphedge enumerationsquare sum

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Enumeration in graph theory (05C30) Elementary theory of partitions (11P81) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• The fast skew-closure algorithm

This page was built for publication: On the number of edges in the transitive closure of a graph