Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00243117n
Noun Concept
Categories: Regular graphs, Individual graphs
EN
Foster graph
EN
In the mathematical field of graph theory, the Foster graph is a bipartite 3-regular graph with 90 vertices and 135 edges. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the Foster graph is a bipartite 3-regular graph with 90 vertices and 135 edges. Wikipedia
Bipartite 3-regular graph with 90 vertices and 135 edges Wikidata
IS A
symmetric graph
bipartite graph
Hamiltonian path
snark
distance-transitive graph
+1 relations
HAS PARTS OF THE CLASS
vertex
edge
NAMED AFTER
Ronald M. Foster
STUDIED BY
graph theory
Wikipedia
EN
Foster graph
Wikidata
EN
Foster 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