In graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter If the degree of such a graph is d ... Bounding vertices by degree... · Moore graphs as cages |
| Граф Мура |  |
Нерешённые проблемы математики: Существует ли граф Мура с обхватом 5 и степенью 57?
Граф Мура — регулярный граф степени d и диаметром k, число вершин которого равно верхней границе
{\displaystyle 1+d\sum _{i=0}^{k-1}^{i}.}
Эквивалентное... Википедия
![The Moore graph for d=3\documentclass[12pt]{minimal ...](imgx.php?https://www.researchgate.net/publication/361539218/figure/fig5/AS:11431281078771704@1660269219745/The-Moore-graph-for-d3documentclass12ptminimal-usepackageamsmath.png)
The Petersen graph is a graph with 10 vertices and 15 edges. It can be described in the following two ways: 1. The Kneser graph KG(5,2), ... |
Moore observed that in graphs for which equality holds in (2) every node is of degree d, since it necessitates that equality hold in (1) for each i. •. II ER 0. |
A graph whose order is equal to the Moore bound M∆,D is called a Moore graph; such a graph is necessarily regular of degree ∆. The study of Moore graphs was ... |
22 мар. 2013 г. · , i.e. all vertices have the same valency. So a Moore graph is characterised by its diameter and valency. Moore graphs with ... |
A graph whose number of vertices is the Moore bound M(∆,D) is called a Moore graph, which is known to be necessarily regular of degree ∆ = k, see Singleton [21] ... |
Videolar| Novbeti > |
| Axtarisha Qayit Anarim.Az Anarim.Az Sayt Rehberliyi ile Elaqe Saytdan Istifade Qaydalari Anarim.Az 2004-2023 |