In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a...
29 KB (3,553 words) - 14:38, 26 August 2024
In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other...
40 KB (5,451 words) - 01:02, 17 August 2024
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In...
23 KB (2,938 words) - 07:47, 18 July 2024
mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need...
17 KB (2,062 words) - 09:56, 10 July 2024
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...
6 KB (805 words) - 08:53, 15 February 2024
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors...
15 KB (1,825 words) - 10:14, 23 April 2024
In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination...
31 KB (4,082 words) - 12:55, 12 August 2024
mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U {\displaystyle...
33 KB (4,093 words) - 05:52, 26 August 2024
In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph...
30 KB (3,441 words) - 12:55, 5 July 2024
bipartite graph Disperser Expander Extractor Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement...
7 KB (664 words) - 12:10, 30 October 2023
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
107 KB (15,784 words) - 17:42, 20 August 2024
Independent set of elements of a matroid. See Matroid#Independent sets. Independent set (graph theory), a set of vertices that share no edges. This disambiguation...
273 bytes (71 words) - 00:04, 3 February 2013
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem...
24 KB (3,433 words) - 00:05, 30 April 2024
In the mathematical area of graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices...
20 KB (2,496 words) - 08:26, 28 December 2023
essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative...
10 KB (1,360 words) - 09:43, 1 August 2022
graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
67 KB (7,996 words) - 16:56, 29 August 2024
mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...
52 KB (6,403 words) - 00:08, 30 August 2024
Stable set may refer to: Independent set (graph theory) in graph theory, a set of vertices no two of which are adjacent Invariant set, said to be "stable"...
538 bytes (103 words) - 15:21, 2 April 2022
graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G...
10 KB (1,122 words) - 08:52, 18 August 2023
mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected...
12 KB (959 words) - 07:51, 18 July 2024
In graph theory, a part of mathematics, a k-partite graph is a graph whose vertices are (or can be) partitioned into k different independent sets. Equivalently...
4 KB (399 words) - 08:07, 16 July 2024
In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that...
7 KB (903 words) - 09:27, 5 June 2024
specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs makes...
29 KB (4,690 words) - 21:09, 11 May 2024
In graph theory, the metric dimension of a graph G is the minimum cardinality of a subset S of vertices such that all other vertices are uniquely determined...
20 KB (2,517 words) - 12:44, 12 August 2024
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges...
43 KB (5,299 words) - 10:28, 5 July 2024
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...
59 KB (7,042 words) - 19:21, 6 May 2024
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. Split...
15 KB (1,642 words) - 07:38, 22 July 2024
graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is...
26 KB (3,160 words) - 03:11, 19 August 2024
the sense of graph theory in one of two ways: either as a tree (graph theory) or as a trivially perfect graph. In the first case, the graph is the undirected...
11 KB (1,310 words) - 19:13, 19 April 2024
In graph theory, an interval graph is an undirected graph formed from a set of intervals on the real line, with a vertex for each interval and an edge...
22 KB (2,640 words) - 01:39, 27 August 2024