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.
2017
2017
In this paper we generalize the concept of uniquely $K_r$-saturated graphs to hypergraphs. Let $K_r^{(k)}$ denote the complete $k… 
2012
2012
A graph G is k-colorable if G has a proper vertex coloring with k colors. The chromatic number (G) is the minimum number k such… 
2012
2012
1. b-colorings and b-continuity are graph theoretical concepts. In 1999, Irving and Manlove introduced the concept of b-colorings… 
2011
2011
The domination polynomial of a graph G of order n is the polynomial , where d(G, i) is the number of dominating vertex sets of G… 
2011
2011
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
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
The graph b-coloring is an interesting technique that can be applied to various domains. The proper b-coloring problem is the… 
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
An infinite class of counterexamples is given to a conjecture of Dahme et al. [Discuss. Math. Graph Theory, 24 (2004) 423–430…