{"version":"1.0","type":"link","title":"Level structure - Newikis","description":"In the mathematical subfield of graph theory a level structure of a rooted graph is a partition of the vertices into subsets that have the same distance from a given root vertex.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/d/d3/Graph_level_structure.svg/1280px-Graph_level_structure.svg.png","thumbnail_width":1280,"thumbnail_height":528}