Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01753612n
Noun Concept
Categories: Individual graphs, Regular graphs
EN
Ljubljana graph
EN
In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the Ljubljana graph is an undirected bipartite graph with 112 vertices and 168 edges. Wikipedia
IS A
asymmetric graph
bipartite graph
Hamiltonian path
semi-symmetric graph
cubic graph
+1 relations
HAS PARTS OF THE CLASS
vertex
edge
STUDIED BY
graph theory
Wikipedia
EN
Ljubljana graph
Wikidata
EN
Ljubljana 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