Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,436,967 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Apex (geometry)
Apex graph
Complement graph
Connected dominating set
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Uniquely $K^{(k)}_r$-saturated Hypergraphs
Andr'as Gy'arf'as
,
S. Hartke
,
Charles Viss
2017
Corpus ID: 53663950
In this paper we generalize the concept of uniquely $K_r$-saturated graphs to hypergraphs. Let $K_r^{(k)}$ denote the complete $k…
Expand
2012
2012
B-Continuity in Peterson graph and power of a Cycle
S. Kumar
,
T. Nicholas
2012
Corpus ID: 5696511
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…
Expand
2012
2012
On b-colorings and b-continuity of graphs
Mais Alkhateeb
2012
Corpus ID: 124847965
1. b-colorings and b-continuity are graph theoretical concepts. In 1999, Irving and Manlove introduced the concept of b-colorings…
Expand
2011
2011
On the graphs with four distinct domination roots
S. Alikhani
International Journal of Computational…
2011
Corpus ID: 42771320
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…
Expand
2011
2011
Upper bounds on the b-chromatic number and results for restricted graph classes
Mais Alkhateeb
,
Anja Kohl
Discussiones Mathematicae Graph Theory
2011
Corpus ID: 10971144
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…
Expand
2010
2010
Fall coloring of graphs I
R. Balakrishnan
,
T. Kavaskar
Discussiones Mathematicae Graph Theory
2010
Corpus ID: 10776470
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…
Expand
Review
2008
Review
2008
A Graph b-coloring Framework for Data Clustering
H. Elghazel
,
H. Kheddouci
,
V. Deslandres
,
A. Dussauchoy
J. Math. Model. Algorithms
2008
Corpus ID: 207176030
The graph b-coloring is an interesting technique that can be applied to various domains. The proper b-coloring problem is the…
Expand
2006
2006
A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data
H. Elghazel
,
V. Deslandres
,
Mohand-Said Hacid
,
A. Dussauchoy
,
H. Kheddouci
International Syposium on Methodologies for…
2006
Corpus ID: 1183411
Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a…
Expand
2006
2006
A New Graph-Based Clustering Approach: Application to PMSI Data
H. Elghazel
,
H. Kheddouci
,
V. Deslandres
,
A. Dussauchoy
International Conference on Service Systems and…
2006
Corpus ID: 19272614
Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a…
Expand
2005
2005
Highly connected counterexamples to a conjecture on ά -domination
Z. Tuza
Discussiones Mathematicae 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…
Expand
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)
ACCEPT & CONTINUE