Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01351422n
Noun Concept
Categories: Individual graphs
EN
diamond graph  diamond-free graph
EN
In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. Wikipedia
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. Wikipedia
Node-link graph with four vertices and five edges Wikidata
IS A
planar graph
Hamiltonian path
unit distance graph
DEPICTS
diamond
HAS PARTS OF THE CLASS
vertex
edge
NAMED AFTER
diamond
STUDIED BY
graph theory
Wikipedia
EN
diamond graph
Wikidata
EN
diamond graph
Wikipedia Redirections
EN
diamond-free 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