z-logo
Premium
The smallest graph of girth 6 and valency 7
Author(s) -
O'Keefe M.,
Wong P. K.
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050105
Subject(s) - valency , mathematics , combinatorics , girth (graph theory) , graph , distance regular graph , discrete mathematics , odd graph , regular graph , graph power , wheel graph , line graph , 1 planar graph , philosophy , linguistics
With the aid of a computer. we give a regular graph of girth 6 and valency 7, which has 90 vertices and show that this is the unique smallest graph with these properties.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here