{"version":"1.0","type":"link","title":"Moore graph - Newikis","description":"In graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the degree of such a graph is d and its diameter is k, its girth must equal 2k + 1. This is true, for a graph of degree d…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}