Skip to search formSkip to main contentSkip to account menu

Universal vertex

Known as: Cone (graph theory), Dominating vertex 
In graph theory, a universal vertex is a vertex of an undirected graph that is adjacent to all other vertices of the graph. It may also be called a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Apex (geometry)Apex graphComplement graphConnected dominating set

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A note on Fibonacci and Lucas number of domination in path
Let G = ( V ( G ), E ( G )) be a path of order n ≥ 1 . Let f m ( G ) be a path with m ≥ 0 independent dominating vertices which… 
2016
2016
On the Complexity of Computing Treebreadth
During the last decade, metric properties of the bags of tree decompositions of graphs have been studied. Roughly, the length and… 
2012
2012
On graph contractions and induced minors
2011
2011
Upper bounds on the b-chromatic number and results for restricted graph classes
A b-coloring of a graph G by k colors is a proper vertex coloring such that every color class contains a color-dominating vertex… 
2010
2010
Fall coloring of graphs I
A fall coloring of a graph G is a proper coloring of the vertex set of G such that every vertex of G is a color dominating vertex… 
Review
2008
Review
2008
A Graph b-coloring Framework for Data Clustering
The graph b-coloring is an interesting technique that can be applied to various domains. The proper b-coloring problem is the… 
2006
2006
A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data
Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a… 
2006
2006
A New Graph-Based Clustering Approach: Application to PMSI Data
Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a… 
2005
2005
On algorithms for (P5, gem)-free graphs
2005
2005
Highly connected counterexamples to a conjecture on ά -domination
An infinite class of counterexamples is given to a conjecture of Dahme et al. [Discuss. Math. Graph Theory, 24 (2004) 423–430… 
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)