Statements (45)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
graph |
| gptkbp:alternativeName |
chart
Graph cage_(graph_theory) complete_graph directed_graph graph_algorithm graph_database graph_theory_concept graph_theory_problem graphic polyhedral_graph undirected_graph граф график |
| gptkbp:application |
gptkb:extremal_graph_theory
|
| gptkbp:arises_from |
skeleton of a convex polyhedron
|
| gptkbp:characterizedBy |
gptkb:Steinitz's_theorem
|
| gptkbp:defines |
a regular graph of degree k and girth g with the minimum possible number of vertices
|
| gptkbp:example |
Heawood graph is a (3,6)-cage
Petersen graph is a (3,5)-cage Tutte–Coxeter graph is a (3,8)-cage |
| gptkbp:field |
graph theory
|
| gptkbp:hasProperty |
planarity
3-vertex-connectivity |
| gptkbp:heldBy |
gptkb:planar_graph
3-connected planar graph |
| gptkbp:notation |
(k,g)-cage
|
| gptkbp:property |
k-regular
girth g minimal number of vertices |
| gptkbp:relatedTo |
gptkb:Moore_graph
regular graph convex polyhedron planar embedding girth |
| gptkbp:studiedBy |
gptkb:geometry
gptkb:mathematician gptkb:mathematics combinatorics |
| gptkbp:used_in |
graph theory
|
| gptkbp:bfsParent |
gptkb:Bethe_lattice
gptkb:brand |
| gptkbp:bfsLayer |
4
|