Skip to search formSkip to main contentSkip to account menu

Wheel graph

Known as: Wheel (disambiguation) 
In the mathematical discipline of graph theory, a wheel graph is a graph formed by connecting a single vertex to all vertices of a cycle. A wheel… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
Antiprism graphApex graphArchimedean graphChromatic polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On irregular colorings of double wheel graph families
An assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper… 
2017
2017
DIMENSI METRIK KUAT PADA GRAF WHEEL, GRAF GENERALIZED JAHANGIR, DAN GRAF GENERALIZED PRISM
Misalkan G adalah graf terhubung dengan himpunan vertex V (G) = {v1,v2,...,vn} dan himpunan edge E(G) = {e1,e2,...,em}. Untuk… 
2017
2017
Weak Domination Alteration Sets in Fuzzy Graphs
In general yf (G) can be made to increase or decrease by the removal of nodes from fuzzy graph G. In this paper the effect of the… 
2016
2016
Boundary Domination of Line and Middle Graph of Wheel Graph Families
Let G = (V;E) be a connected graph. A subset S of V (G) is called a boundary dominating set if every vertex of V S is boundary… 
2016
2016
Pelabelan Selimut H-Ajaib Super pada Koronasi Beberapa Kelas Graf dengan Graf Lintasan
Graf sederhana G = (V,E) memuat selimut H jika setiap sisi pada E memu-at subgraf di G yang isomork dengan H. Andaikan suatu graf… 
2015
2015
On Properties of r w -Regular Graphs
On Properties of rw-Regular Graphs by 
2014
2014
Some Results on Prime Labeling Of Graphs
A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not… 
2013
2013
Double-Wheel Graphs Are Graceful
We present the first polynomial time construction procedure for generating graceful double-wheel graphs. A graph is graceful if… 
2010
2010
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families
Tulgeity �(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper we find the… 
2010
2010
On integer radii coin representations of the wheel graph
A {\em flower} is a coin graph representation of the wheel graph. A {\em petal} of the wheel graph is an edge to the center… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)