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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
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… 
2013
2013
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph… 
2010
2010
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… 
2008
2008
For a fixed pattern graph H, let H‐CONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to… 
2006
2006
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
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
  • Z. Tuza
  • Discuss. Math. Graph Theory
  • 2005
  • Corpus ID: 15772300
An infinite class of counterexamples is given to a conjecture of Dahme et al. [Discuss. Math. Graph Theory, 24 (2004) 423–430… 
1994
1994