In the mathematical field of graph theory, a cage is a regular graph that has as few vertices as possible for its girth. The Tutte (3,8)-cage. |
A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally ... |
| Клетка Теория графов |  |
n-клетка — кубический граф обхвата n с наименьшим возможным числом вершин. Граф называется кубическим, если из каждой его вершины выходят 3 ребра. Обхват графа — это длина наименьшего цикла в нём.
Для каждого 2 < n < 9 существует единственная... Википедия
18 мар. 2015 г. · Cages have been discussed previously, but as a reminder: A (k, g)-cage is the smallest graph which is k-regular and has girth g. |
CaGe is an Open Source software package, implemented in C and Java. CaGe's task is to generate mathematical graphs of different types -- often types that relate ... |
22 мая 2008 г. · Abstract. A (k, g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of ... |
The Robertson graph is the unique (4,5)-cage graph and was discovered by Robertson in 1964. As a cage graph, it is the smallest 4-regular graph with girth 5. |
A (k,g)-cage is a regular graph of valency k and girth g and minimal number of vertices. The problem of determining the size v(k,g) of a (k,g)-cage was posed in ... |
The Chemical and abstract Graph environment. Contribute to CaGe-graph/CaGe development by creating an account on GitHub. |
14 апр. 2017 г. · Find the smallest number of vertices c(k,g) in a (k,g) graph. The (k,g) graphs which have exactly c(k, g) vertices are known as cages. |
Запросы по теме
| Novbeti > |
| Axtarisha Qayit Anarim.Az Anarim.Az Sayt Rehberliyi ile Elaqe Saytdan Istifade Qaydalari Anarim.Az 2004-2023 |