Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01752518n
Noun Concept
Categories: Individual graphs, Regular graphs
EN
Meredith graph
EN
In the mathematical field of graph theory, the Meredith graph is a 4-regular undirected graph with 70 vertices and 140 edges discovered by Guy H. J. Meredith in 1973. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the Meredith graph is a 4-regular undirected graph with 70 vertices and 140 edges discovered by Guy H. J. Meredith in 1973. Wikipedia
4-regular undirected graph with 70 vertices and 140 edges Wikidata
IS A
symmetric graph
k-edge-connected graph
k-vertex-connected graph
regular graph
Eulerian graph
+1 relations
HAS PARTS OF THE CLASS
vertex
edge
STUDIED BY
graph theory
Wikipedia
EN
Meredith graph
Wikidata
EN
Meredith graph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License