Moore graph
In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1. Another equivalent definition of a Moore graph G is that it has girth g = 2k+1 and precisely cycles of length g, where n,m is the number of vertices (resp. edges) of G. They are in fact extremal with respect to the number of cycles whose length is the girth of the graph ().
Moore graph
In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1. Another equivalent definition of a Moore graph G is that it has girth g = 2k+1 and precisely cycles of length g, where n,m is the number of vertices (resp. edges) of G. They are in fact extremal with respect to the number of cycles whose length is the girth of the graph ().
has abstract
Em Teoria dos Grafos, um Grafo ...... ente, esses grafos são jaulas.
@pt
En théorie des graphes, un gra ...... ire et classifier ces graphes.
@fr
In graph theory, a Moore graph ...... again these graphs are cages.
@en
Граф Мура — регулярный граф ст ...... графы снова являются клетками.
@ru
グラフ理論においてムーアグラフとは、次数d、直径kの正則グラ ...... できる。そのような拡張されたムーアグラフはまたケージとなる。
@ja
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
721,070,127
title
Hoffman-Singleton Theorem
urlname
Hoffman-SingletonTheorem
subject
comment
Em Teoria dos Grafos, um Grafo ...... mento é a cintura do grafo. ()
@pt
En théorie des graphes, un gra ...... ire et classifier ces graphes.
@fr
In graph theory, a Moore graph ...... is the girth of the graph ().
@en
Граф Мура — регулярный граф ст ...... и классификации таких графов.
@ru
グラフ理論においてムーアグラフとは、次数d、直径kの正則グラ ...... できる。そのような拡張されたムーアグラフはまたケージとなる。
@ja
label
Grafo de Moore
@pt
Graphe de Moore
@fr
Moore graph
@en
Граф Мура
@ru
ムーアグラフ
@ja