In graph theory, a quotient graph Q of a graph G is a graph whose vertices are blocks of a partition of the vertices of G and where block B is adjacent...
5 KB (621 words) - 07:08, 26 May 2025
is a circle graph, so testing whether a graph is a circle graph can be reduced to the same problem on the prime quotient graphs of the graph. More, when...
10 KB (1,328 words) - 00:18, 8 November 2023
(mathematics) Quotient category Quotient graph Integer division Quotient module Quotient object Quotient of a formal language, also left and right quotient Quotient...
8 KB (825 words) - 05:19, 31 January 2025
connected graph of groups. It admits an orientation-preserving action on a tree: the original graph of groups can be recovered from the quotient graph and the...
7 KB (827 words) - 21:34, 9 March 2025
graph; dual graph; medial graph; quotient graph; Y-Δ transform; Mycielskian. Binary operations create a new graph from two initial graphs G1 = (V1, E1)...
5 KB (512 words) - 23:48, 9 March 2025
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...
109 KB (16,011 words) - 18:32, 30 April 2025
can define the natural notion of a quotient graph of groups A. The underlying graph A of A is the quotient graph X/G. The vertex groups of A are isomorphic...
41 KB (5,901 words) - 16:04, 13 February 2025
Subobject (redirect from Quotient object)
a subobject is a quotient object. This generalizes concepts such as quotient sets, quotient groups, quotient spaces, quotient graphs, etc. An appropriate...
6 KB (907 words) - 11:26, 22 May 2024
Equivalence class (redirect from Quotient set)
The set of the equivalence classes is sometimes called the quotient set or the quotient space of S {\displaystyle S} by ∼ , {\displaystyle \sim ,} and...
17 KB (2,417 words) - 17:27, 23 May 2025
Modular decomposition (category Graph theory objects)
description of modular quotients and the graph decomposition they give rise to appeared in (Gallai 1967). A module of a graph is a generalization of a...
22 KB (3,177 words) - 03:46, 20 June 2025
countable rank (given by 1 plus the Euler characteristic of the quotient graph). The Cayley graph of a free group of finite rank, with respect to a free generating...
18 KB (2,310 words) - 17:25, 30 April 2025
the quotient of the number of vertices in G {\displaystyle G} and the independent number α ( G ) {\displaystyle \alpha (G)} . In a bipartite graph with...
30 KB (3,561 words) - 16:58, 9 June 2025
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract...
29 KB (4,692 words) - 21:36, 19 June 2025
Edge contraction (redirect from Graph contraction)
one can identify vertices in the partition; the resulting graph is known as a quotient graph. Vertex cleaving, which is the same as vertex splitting, means...
8 KB (1,234 words) - 11:55, 1 January 2025
In algebraic topology and graph theory, graph homology describes the homology groups of a graph, where the graph is considered as a topological space....
12 KB (2,179 words) - 12:20, 19 May 2025
In single-variable calculus, the difference quotient is usually the name for the expression f ( x + h ) − f ( x ) h {\displaystyle {\frac {f(x+h)-f(x)}{h}}}...
21 KB (4,699 words) - 16:46, 28 May 2024
Cyclic group (section Cycle graph)
with a cyclic quotient, ending in the trivial group. Every finitely generated abelian group or nilpotent group is polycyclic. Cycle graph (group) Cyclic...
36 KB (4,113 words) - 20:19, 19 June 2025
Reeb graph is the quotient space X /~ endowed with the quotient topology. Generally, this quotient space does not have the structure of a finite graph. Even...
13 KB (1,671 words) - 17:45, 6 June 2025
Connected space (section Graphs)
identify them at every point except zero. The resulting space, with the quotient topology, is totally disconnected. However, by considering the two copies...
27 KB (3,874 words) - 20:36, 24 March 2025
Encephalization quotient (EQ), encephalization level (EL), or just encephalization is a relative brain size measure that is defined as the ratio between...
50 KB (5,709 words) - 05:37, 28 May 2025
List of data structures (redirect from Graph-based data structures)
graph-based data structures are used in computer science and related fields: Graph Adjacency list Adjacency matrix Graph-structured stack Scene graph...
9 KB (914 words) - 05:55, 20 March 2025
G ) {\displaystyle d(G)} is the diameter. A graph is I {\displaystyle I} -bipartite, if the quotient graph of G {\displaystyle G} with I {\displaystyle...
6 KB (765 words) - 19:20, 28 July 2024
s} are the quotient and remainder of dividing n {\displaystyle n} by r {\displaystyle r} (so n = q r + s {\displaystyle n=qr+s} ), the graph is of the...
10 KB (1,262 words) - 13:42, 15 July 2024
study of homogeneous flows on the quotient spaces) and in combinatorics (through the construction of expanding Cayley graphs and other combinatorial objects)...
31 KB (4,840 words) - 21:39, 26 January 2025
In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers λ , μ ≥ 0...
21 KB (3,491 words) - 19:25, 2 June 2025
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander...
41 KB (5,391 words) - 22:16, 19 June 2025
Equivalence relation (redirect from Graphing equivalence)
is a partition of the set X {\displaystyle X} . It is also called the quotient set of X {\displaystyle X} by R {\displaystyle R} . The following relations...
31 KB (4,473 words) - 10:22, 23 May 2025
Logarithm (section Product, quotient, power, and root)
and quotient of two positive numbers c and d were routinely calculated as the sum and difference of their logarithms. The product cd or quotient c/d came...
98 KB (11,674 words) - 05:46, 10 June 2025
Hermitian matrix (section Rayleigh quotient)
often exhibit Hermitian properties. In graph theory, Hermitian matrices are used to study the spectra of graphs. The Hermitian Laplacian matrix is a key...
20 KB (3,028 words) - 01:11, 26 May 2025
chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation...
57 KB (7,280 words) - 04:41, 1 June 2025