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.
2019
2019
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex I: An Approximate Asymptotic Result
In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a… 
2018
2018
O C ] 9 A ug 2 01 8 Laplacian Controllability of Interconnected Graphs
In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input… 
2017
2017
Uniquely $K^{(k)}_r$-saturated Hypergraphs
In this paper we generalize the concept of uniquely $K_r$-saturated graphs to hypergraphs. Let $K_r^{(k)}$ denote the complete $k… 
2013
2013
A-1-1 A node weight equalization by connected dominating vertex set
2012
2012
On b-colorings and b-continuity of graphs
1. b-colorings and b-continuity are graph theoretical concepts. In 1999, Irving and Manlove introduced the concept of b-colorings… 
2012
2012
INDUCED MINORS
The INDUCED MINOR CONTAINMENT problem takes as input two graphs G and H , and asks whether G has H as an induced minor. We show… 
2011
2011
Almost All Cop-win Graphs Have a Universal Vertex
Cops and Robbers is a vertex-pursuit game played on graphs which has received much recent attention. Graphs where one cop has a… 
2007
2007
A Graph-based Approach for Dynamic Clustering
Clustering algorithms consist in automatically discovering structure of large data set or providing coherent groups of objects… 
2007
2007
Clustering With Constraints Using Graph Based Approach
Clustering can be considered as the most important unsupervised learning problem which deals with finding a structure in a… 
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)