Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01766696n
Noun Concept
Categories: Regular graphs, Individual graphs
EN
Holt graph  Doyle graph  Holt's graph
EN
In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive graph which is not also symmetric. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, the Holt graph or Doyle graph is the smallest half-transitive graph, that is, the smallest example of a vertex-transitive and edge-transitive graph which is not also symmetric. Wikipedia
Node-link graph with 27 vertices and 54 edges, the smallest half-transitive graph Wikidata
IS A
half-transitive graph
Hamiltonian path
Cayley graph
vertex-transitive graph
edge-transitive graph
+1 relations
HAS PARTS OF THE CLASS
vertex
edge
STUDIED BY
graph theory
Wikipedia
EN
Holt graph
Wikidata
EN
Holt graph
Wikipedia Redirections
EN
Doyle graph, Holt's graph
Wikidata Alias
EN
Doyle 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