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 $\frac{n}{g}(m-n+1)$ 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 (Azarija & Klavžar 2015).

单词	Moore bound
释义	Moore bound 英语百科 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 $\frac{n}{g}(m-n+1)$ 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 (Azarija & Klavžar 2015).
随便看	transdifferentiates的意思 transdifferentiating的意思 transdifferentiation的意思 transdifferentiation的意思 transdignify的意思 Transdimensional的意思 transdimethyltetrahydronaphthalene的意思 transdiode的意思 transdisciplinaries的意思 Transdisciplinarity的意思 transdisciplinary的意思 transdiscursive的意思 transdiurnal的意思 transdneister的意思 Transdniestr的意思 Transdniestria的意思 transdniestrs的意思 transdominant的意思 trans dominant inactivating的意思 trans dominant inhibitor的意思 trans dominant negative mutant的意思 transdonor的意思 transdouble bond的意思 trans double bond的意思 transduate的意思

Moore bound

Moore graph