| Information | |
|---|---|
| has gloss | eng: In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one. Edges of unit distance graphs sometimes cross each other, so they are not always planar; a unit distance graph without crossings is called a matchstick graph. |
| lexicalization | eng: unit distance graph |
| lexicalization | eng: Unit-distance graph |
| instance of | c/Geometric graphs |
| Meaning | |
|---|---|
| French | |
| has gloss | fra: En mathématiques, plus particulièrement en théorie des graphes, un graphe distance-unité est un graphe sobtenant à partir dune collection de point du plan euclidien en reliant par une arête toutes les paires de points étant à une distance de 1. Les arêtes peuvent se croiser si bien quun graphe distance-unité nest pas nécessairement un graphe planaire. |
| lexicalization | fra: graphe distance-unité |
| Media | |
|---|---|
| media:img | Hypercubestar.svg |
| media:img | Möbius–Kantor unit distance.svg |
| media:img | Petersen graph, unit distance.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
