{"version":"1.0","type":"link","title":"Nested triangles graph - Newikis","description":"In graph theory, a nested triangles graph with n vertices is a planar graph formed from a sequence of n/3 triangles, by connecting pairs of corresponding vertices on consecutive triangles in the sequence. It can also be formed geometrically, by gluing together n/3 − 1 triangular prisms on their…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/2/28/Nested_triangle_graph_18.svg/1280px-Nested_triangle_graph_18.svg.png","thumbnail_width":1280,"thumbnail_height":1135}