{"version":"1.0","type":"link","title":"Modular graph - Newikis","description":"In graph theory, a branch of mathematics, the modular graphs are undirected graphs in which every three vertices x, y, and z have at least one median vertex m(x, y, z) that belongs to shortest paths between each pair of x, y, and z. Their name comes from the fact that a finite lattice is a modular…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/7/79/2d_modular_lattice.svg/1280px-2d_modular_lattice.svg.png","thumbnail_width":1280,"thumbnail_height":1960}