Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A coloring c of a graph $$G=(V,E)$$G=(V,E) is a b-coloring if for every color i there is a vertex, say w(i), of color i whose… Expand
  • figure 2
2015
2015
The article presents analysis of the Internet topology graph model. We use usual methods to analyse properties of the model but… Expand
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
2014
2014
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We… Expand
  • figure 1
2013
2013
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2009
2009
The wheel graph, denoted by W"n"+"1, is the graph obtained from the circuit C"n with n vertices by adding a new vertex and… Expand
  • figure 1
  • figure 2
2008
2008
For a fixed pattern graph H , let H -Contractibility denote the problem of deciding whether a given input graph is contractible… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
2007
2007
Clustering can be considered as the most important unsupervised learning problem which deals with finding a structure in a… Expand
  • table 1
  • figure 3
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… Expand
  • table 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
1997
1997
  • A. Hertz
  • Discret. Appl. Math.
  • 1997
  • Corpus ID: 16713915
Abstract We study a transformation of pseudo-Boolean functions which, when applicable, amounts to constructing from a graph G… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1994
1994
Abstract A family (( S v , T v )∣ v ∈ V ) of ordered pairs of intervals of the real line, each S v containing its corresponding T… Expand