Faster access than browser!
24 relations: Apex (geometry), Apex graph, Comparability graph, Cop-win graph, Cycle graph, Degree (graph theory), Discrete Mathematics (journal), Dominating set, Graph (discrete mathematics), Graph theory, Independent set (graph theory), Induced subgraph, Logic of graphs, N-skeleton, Pyramid (geometry), Split graph, Star (graph theory), Threshold graph, Tree (graph theory), Tree (set theory), Trivially perfect graph, Universal quantification, Vertex (graph theory), Wheel graph.
Apex (geometry)
In geometry, an apex (Latin for 'summit, peak, tip, top, extreme end') is the vertex which is in some sense the "highest" of the figure to which it belongs.
New!!: Universal vertex and Apex (geometry) · See more »
Apex graph
In graph theory, a branch of mathematics, an apex graph is a graph that can be made planar by the removal of a single vertex.
New!!: Universal vertex and Apex graph · See more »
Comparability graph
In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order.
New!!: Universal vertex and Comparability graph · See more »
Cop-win graph
In graph theory, a cop-win graph is an undirected graph on which the pursuer (cop) can always win a pursuit-evasion game in which he chases a robber, the players alternately moving along an edge of a graph or staying put, until the cop lands on the robber's vertex.
New!!: Universal vertex and Cop-win graph · See more »
Cycle graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain.
New!!: Universal vertex and Cycle graph · See more »
Degree (graph theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.
New!!: Universal vertex and Degree (graph theory) · See more »
Discrete Mathematics (journal)
Discrete Mathematics is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications.
New!!: Universal vertex and Discrete Mathematics (journal) · See more »
Dominating set
In graph theory, a dominating set for a graph G.
New!!: Universal vertex and Dominating set · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Universal vertex and Graph (discrete mathematics) · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Universal vertex and Graph theory · See more »
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.
New!!: Universal vertex and Independent set (graph theory) · See more »
Induced subgraph
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset.
New!!: Universal vertex and Induced subgraph · See more »
Logic of graphs
In the mathematical fields of graph theory and finite model theory, the logic of graphs deals with formal specifications of graph properties using logical formulas.
New!!: Universal vertex and Logic of graphs · See more »
N-skeleton
In mathematics, particularly in algebraic topology, the of a topological space X presented as a simplicial complex (resp. CW complex) refers to the subspace Xn that is the union of the simplices of X (resp. cells of X) of dimensions In other words, given an inductive definition of a complex, the is obtained by stopping at the.
New!!: Universal vertex and N-skeleton · See more »
Pyramid (geometry)
In geometry, a pyramid is a polyhedron formed by connecting a polygonal base and a point, called the apex.
New!!: Universal vertex and Pyramid (geometry) · See more »
Split graph
In graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set.
New!!: Universal vertex and Split graph · See more »
Star (graph theory)
In graph theory, a star Sk is the complete bipartite graph K1,k: a tree with one internal node and k leaves (but, no internal nodes and k + 1 leaves when k ≤ 1).
New!!: Universal vertex and Star (graph theory) · See more »
Threshold graph
In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations.
New!!: Universal vertex and Threshold graph · See more »
Tree (graph theory)
In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path.
New!!: Universal vertex and Tree (graph theory) · See more »
Tree (set theory)
In set theory, a tree is a partially ordered set (T, \omega + 1.
New!!: Universal vertex and Tree (set theory) · See more »
Trivially perfect graph
In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals the number of maximal cliques.
New!!: Universal vertex and Trivially perfect graph · See more »
Universal quantification
In predicate logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any" or "for all".
New!!: Universal vertex and Universal quantification · See more »
Vertex (graph theory)
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
New!!: Universal vertex and Vertex (graph theory) · See more »
Wheel graph
In the mathematical discipline of graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle.
New!!: Universal vertex and Wheel graph · See more »
Redirects here:
Cone (graph theory), Dominating vertex.
References
[1] https://en.wikipedia.org/wiki/Universal_vertex
