Directed Moore hypergraphs

DOI10.1016/0166-218X(94)00069-PzbMath0839.05076OpenAlexW1977902503WikidataQ127957294 ScholiaQ127957294MaRDI QIDQ1902896

Fahir Ö. Ergincan, David A. Gregory

Publication date: 5 June 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00069-p

zbMATH Keywords

matrix factorizationsdirected hypergraphconjecture of Jean-Claude Bermonddirected Moore hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Partial line directed hypergraphs ⋮ Bus interconnection networks

Cites Work

• On finite Moore geometries
• Directed graphs with unique paths of fixed length
• On the impossibility of directed Moore graphs
• Combinatorial designs related to the strong perfect graph conjecture
• A generalization of Moore graphs of diameter two
• Combinatorial designs and related systems
• The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
• Graph Algorithms for Functional Dependency Manipulation
• On Moore Graphs with Diameters 2 and 3
• On Moore Geometries, I
• On Moore geometries. II
• De Bruijn and Kautz bus networks
• Perfect zero–one matrices
• The nonexistence of Moore geometries of diameter 4
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Directed Moore hypergraphs