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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper, we studied the Incident Binary Equivalent Decimal Edge Graceful Labeling (IBEDE) [1] and Strong Incident Binary… 
2018
2018
An assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper… 
2016
2016
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced… 
2016
2016
  • S. MehraPuneet
  • 2016
  • Corpus ID: 36153741
The aim of this paper is to introduce a new function that satisfies the property of topological integer additive set-indexer (Top… 
2016
2016
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… 
2015
2015
On Properties of rw-Regular Graphs by 
2014
2014
A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not… 
2014
2014
Much research has involved the consideration of graphs which have subgraphs of a particular kind, such as cliques. Known classes… 
2013
2013
We present the first polynomial time construction procedure for generating graceful double-wheel graphs. A graph is graceful if… 
2010
2010
Tulgeity �(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper we find the…