2008FedUni ResearchOnline (Federation University Australia)Requires access

On graphs of maximum degree 3 and defect 4

Guillermo Pineda‐Villavicencio, Mirka Miller

Open publisher page 5 citations

Abstract

It is well known that apart from the Petersen graph there are no Moore graphs of degree 3. As a cubic graph must have an even number of vertices, there are no graphs of maximum degree 3 and

About this research paper

What this paper is about

It is well known that apart from the Petersen graph there are no Moore graphs of degree 3. As a cubic graph must have an even number of vertices, there are no graphs of maximum degree 3 and

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It is well known that apart from the Petersen graph there are no Moore graphs of degree 3. As a cubic graph must have an even number of vertices, there are no graphs of maximum degree 3 and

Key concepts: Combinatorics, Mathematics, Odd graph, Degree (music), Triangle-free graph, Discrete mathematics, Girth (graph theory), Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
On graphs of maximum degree 3 and defect 4 — Research Paper | ScholarLens