One method for proving the impossibility of certain Moore graphs

DOI10.1016/0012-365X(74)90156-3zbMath0287.05114OpenAlexW2031992279MaRDI QIDQ1845742

Ján Plesník

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90156-3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On the impossibility of certain Moore graphs
• The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
• On Moore Graphs with Diameters 2 and 3
• A Design for (d, k) Graphs
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• A correction to: On the algebraic theory of graph colorings
• On the Equivalence of Finite-State Sequential Machine Models
• Strongly geodetic graphs
• Improved Construction Techniques for (d, k) Graphs

This page was built for publication: One method for proving the impossibility of certain Moore graphs