Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01351422n
Noun Concept
SYL
No term available
EN
In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. Wikipedia
Relations
Sources
IS A
EN
planar graph
EN
Hamiltonian path
EN
unit distance graph
DEPICTS
EN
diamond
HAS PARTS OF THE CLASS
EN
vertex
EN
edge
NAMED AFTER
EN
diamond
STUDIED BY
EN
graph theory

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