In the mathematical field of graph theory, the Chang graphs are three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly...
2 KB (244 words) - 00:40, 2 June 2025
a line graph have been studied, including line graphs of line graphs, line graphs of multigraphs, line graphs of hypergraphs, and line graphs of weighted...
44 KB (5,368 words) - 10:55, 7 June 2025
Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular...
43 KB (4,791 words) - 10:24, 7 June 2025
that such a graph is perfect." Trivially perfect graphs are also known as comparability graphs of trees, arborescent comparability graphs, and quasi-threshold...
11 KB (1,189 words) - 20:48, 28 December 2024
arc-transitive graphs are strongly regular. A strongly regular graph is called primitive if both the graph and its complement are connected. All the above graphs are...
21 KB (3,491 words) - 19:25, 2 June 2025
most 3n maximal cliques. The graphs meeting this bound are the Moon–Moser graphs K3,3,..., a special case of the Turán graphs arising as the extremal cases...
20 KB (2,501 words) - 18:00, 21 February 2025
coloring. Explicit, though large, graphs with high girth and chromatic number can be constructed as certain Cayley graphs of linear groups over finite fields...
7 KB (903 words) - 07:28, 19 December 2024
various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...
7 KB (85 words) - 19:28, 12 March 2024
each other in the cycle. Strongly chordal graphs have a forbidden subgraph characterization as the graphs that do not contain an induced cycle of length...
11 KB (1,167 words) - 10:08, 13 March 2025
Knight's graph Queen's graph Rook's graph Bishop's graph Lattice graph Chess portal Chang, Gerard J. (1998), "Algorithmic aspects of domination in graphs", in...
6 KB (647 words) - 17:50, 21 October 2024
the maximum clique can be found in even-hole-free graphs in polynomial time. "even-cycle--free graphs", www.graphclasses.org, retrieved 2023-03-12 Conforti...
8 KB (727 words) - 00:05, 27 March 2025
bipartition of G. Map graphs are the half-squares of planar graphs, and halved cube graphs are the half-squares of hypercube graphs. Leaf powers are the...
11 KB (1,260 words) - 07:48, 18 July 2024
Shortest path problem (redirect from Single-source shortest-paths algorithms for directed graphs with nonnegative weights)
path problem can be defined for graphs whether undirected, directed, or mixed. The definition for undirected graphs states that every edge can be traversed...
46 KB (4,764 words) - 14:36, 26 April 2025
Graceful labeling (redirect from Graceful graph)
a graph", Theory of Graphs (Internat. Sympos., Rome, 1966), New York: Gordon and Breach, pp. 349–355, MR 0223271. Wang, Tao-Ming; Yang, Cheng-Chang; Hsu...
9 KB (941 words) - 17:04, 24 March 2025
Heterophily (section Heterophilic graph learning)
graphs, where there only exist one type of nodes and edges. However, the theory and methods for heterophily on heterogeneous graphs, temporal graphs and...
13 KB (1,534 words) - 05:17, 30 April 2025
Queue number (category Topological graph theory)
traversal. Pseudoforests and grid graphs also have queue number 1. Outerplanar graphs have queue number at most 2; the 3-sun graph (a triangle with each of its...
24 KB (2,715 words) - 13:33, 12 August 2024
Planar separator theorem (category Statements about planar graphs)
In graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar graph can be split...
73 KB (10,072 words) - 06:45, 12 May 2025
Steinitz's theorem (category Statements about planar graphs)
undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is...
50 KB (5,973 words) - 06:51, 27 May 2025
Minimum spanning tree (section Dense graphs)
which gives a linear run-time for dense graphs. There are other algorithms that work in linear time on dense graphs. If the edge weights are integers represented...
44 KB (5,460 words) - 18:56, 21 May 2025
knowledge graph's entities and relations while preserving their semantic meaning. Leveraging their embedded representation, knowledge graphs (KGs) can...
52 KB (5,953 words) - 05:41, 25 May 2025
sovereignty of the monarchs over subjugated polities. According to Ruth H. Chang, continuation of Shang religion also provided opportunities to further share...
33 KB (3,963 words) - 11:56, 30 March 2025
List of first-order theories (section Graphs)
language of graphs.) The theory of random graphs is ω categorical, complete, and decidable, and its countable model is called the Rado graph. A statement...
36 KB (5,269 words) - 20:51, 27 December 2024
graph is created, subgraphs can be vectorized, stored in a vector database, and used for retrieval as in plain RAG. The advantage here is that graphs...
23 KB (2,451 words) - 17:44, 2 June 2025
graph but cannot be drawn without crossings on a plane. Another family of graphs that can be embedded on the Möbius strip, but not on the plane, are the...
88 KB (9,639 words) - 06:59, 2 June 2025
BERT was originally published by Google researchers Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. The design has its origins from pre-training...
31 KB (3,568 words) - 19:15, 25 May 2025
Applications. Academic Press. pp. 92–93. ISBN 0-12-530985-6. Maki LR, Galyan EL, Chang-Chien MM, Caldwell DR (September 1974). "Ice nucleation induced by pseudomonas...
12 KB (1,345 words) - 06:18, 3 June 2025
in China in containing sequences of graphs; shards were found with horizontal sequences of 12, 7, 5 and 4 graphs, suggesting that they may be a form of...
6 KB (584 words) - 19:32, 19 January 2025
syndrome - Symptoms and causes". Mayo Clinic. Retrieved December 5, 2023. Chang L (March 2011). "The role of stress on physiologic responses and clinical...
122 KB (13,244 words) - 15:04, 9 June 2025
Hopcroft–Karp algorithm (category Graph algorithms)
In the case of dense graphs the time bound becomes O ( | V | 2.5 ) {\displaystyle O(|V|^{2.5})} , and for sparse random graphs it runs in time O ( |...
25 KB (3,746 words) - 14:52, 14 May 2025
Chinese characters (redirect from Han graphs)
in graphical shape (字形; zìxíng), the "external appearances of individual graphs", and in graphical form (字体; 字體; zìtǐ), "overall changes in the distinguishing...
121 KB (14,155 words) - 22:40, 31 May 2025