Matches in DBpedia 2014 for { ?s ?p In the mathematical discipline of graph theory, a wheel graph Wn is a graph with n vertices (n ≥ 4), formed by connecting a single vertex to all vertices of an (n-1)-cycle. The numerical notation for wheels is used inconsistently in the literature: some authors instead use n to refer to the length of the cycle, so that their Wn is the graph we denote Wn+1. A wheel graph can also be defined as the 1-skeleton of an (n-1)-gonal pyramid.. }
Showing items 1 to 2 of
2
with 100 items per page.
- Wheel_graph abstract "In the mathematical discipline of graph theory, a wheel graph Wn is a graph with n vertices (n ≥ 4), formed by connecting a single vertex to all vertices of an (n-1)-cycle. The numerical notation for wheels is used inconsistently in the literature: some authors instead use n to refer to the length of the cycle, so that their Wn is the graph we denote Wn+1. A wheel graph can also be defined as the 1-skeleton of an (n-1)-gonal pyramid.".
- Wheel_graph comment "In the mathematical discipline of graph theory, a wheel graph Wn is a graph with n vertices (n ≥ 4), formed by connecting a single vertex to all vertices of an (n-1)-cycle. The numerical notation for wheels is used inconsistently in the literature: some authors instead use n to refer to the length of the cycle, so that their Wn is the graph we denote Wn+1. A wheel graph can also be defined as the 1-skeleton of an (n-1)-gonal pyramid.".