| Information | |
|---|---|
| has gloss | eng: In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words a cubic graph is a 3-regular graph. Cubic graphs are also called trivalent graphs. It follows from the handshaking lemma, proven by Leonhard Euler in 1736 as part of the first paper on graph theory, that every cubic graph has an even number of vertices. |
| lexicalization | eng: cubic graph |
| instance of | c/Graph families |
| Meaning | |
|---|---|
| Persian | |
| lexicalization | fas: گراف k-مکعب |
| French | |
| has gloss | fra: En théorie des graphes, un graphe cubique est un graphe régulier de degré 3. |
| lexicalization | fra: graphe cubique |
| Korean | |
| has gloss | kor: 큐빅 그래프(cubic graph)는 모든 꼭지점이 정확히 세 개의 변에 접한 그래프를 의미한다. 즉, 큐빅 그래프는 3-정규 그래프이다. |
| lexicalization | kor: 큐빅 그래프 |
| Polish | |
| has gloss | pol: Graf kubiczny (ang. cubic graph, trivalent graph) – graf regularny stopnia 3 (graf 3-regularny). |
| lexicalization | pol: Graf kubiczny |
| Castilian | |
| has gloss | spa: En teoría de grafos, un grafo cúbico o grafo trivalente es un grafo cuyos vértices son todos incidentes a exactamente tres aristas. En otras palabras, un grafo cúbico es un grafo 3-regular. |
| lexicalization | spa: Grafo cubico |
| lexicalization | spa: grafo cúbico |
| Media | |
|---|---|
| media:img | Complete bipartite graph K3,3.svg |
| media:img | Graph-k1.jpg |
| media:img | Graph-k2.jpg |
| media:img | Graph-k4.jpg |
| media:img | Graph-k5.jpg |
| media:img | Graph-k6.jpg |
| media:img | Graph-k7.jpg |
| media:img | Petersen graph blue.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint