One method for proving the impossibility of certain Moore graphs
type: Item
instance of: scholarly article
title: One method for proving the impossibility of certain Moore graphs
zbMATH Open document ID: 0287.05114
DOI: 10.1016/0012-365X(74)90156-3
author: Ján Plesník
published in: Discrete Mathematics
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3450242
MaRDI profile type: Publication
cites work: A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
cites work: The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
cites work: Q5590669
cites work: Strongly geodetic graphs
cites work: Q5520566
cites work: A Design for (d, k) Graphs
cites work: On the impossibility of certain Moore graphs
cites work: Parallel concepts in graph theory
cites work: On Moore Graphs with Diameters 2 and 3
cites work: On the Equivalence of Finite-State Sequential Machine Models
cites work: Improved Construction Techniques for (d, k) Graphs
cites work: Q5785712
cites work: A correction to: On the algebraic theory of graph colorings
full work available at URL: 0012-365x(74)90156-3
OpenAlex ID: W2031992279
description: scientific article; zbMATH DE number 3450242