{"version":"1.0","type":"link","title":"Fan graph - Newikis","description":"In graph theory, a fan graph (also called a path-fan graph) is a graph formed by the join of a path graph and an empty graph on a single vertex. The fan graph on vertices, denoted , is defined as , where is a single vertex and is a path on vertices.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/c/cd/Fan_graphs.svg/1280px-Fan_graphs.svg.png","thumbnail_width":1280,"thumbnail_height":1290}