{"version":"1.0","type":"link","title":"Induced path - Newikis","description":"In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced subgraph of G. That is, it is a sequence of vertices in G such that each two adjacent vertices in the sequence are connected by an edge in G, and each two nonadjacent vertices in the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/2/2c/Snake_in_the_box.svg/1280px-Snake_in_the_box.svg.png","thumbnail_width":1280,"thumbnail_height":1192}