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,360 words) - 18:02, 9 May 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,790 words) - 19:04, 3 June 2025
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
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
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
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
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
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
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
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
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
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
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
into graph database systems, May 2018 Hima Karanam, Sumit Neelam, Udit Sharma, Sumit Bhatia, Srikanta Bedathur, L. Venkata Subramaniam, Maria Chang, Achille...
12 KB (999 words) - 03:40, 5 May 2025
Leaf power (category Perfect graphs)
tolerance NeST graph and such graphs are a proper subclass of strongly chordal graphs. In Brandstädt et al. (2010) it is shown that interval graphs and the larger...
11 KB (1,084 words) - 09:49, 5 January 2024
Radio coloring (category Extensions and generalizations of graphs)
an n-vertex graph can range from 1 to 2n − 1, almost all n-vertex graphs have radio coloring number exactly n. This is because these graphs almost always...
6 KB (638 words) - 08:47, 6 May 2024
entities. In general, networks or graphs are used to capture relationships between entities or objects. A typical graphing representation consists of a set...
50 KB (5,777 words) - 07:42, 7 April 2025
Incidence coloring (category Graph coloring)
chromatic number of a cubic graph G is at most ∆(G) + 2. They proved this for certain cubic graphs such as Hamiltonian cubic graphs. Based on these results...
28 KB (3,817 words) - 08:45, 8 October 2024
Archived from the original on 13 February 2024. Retrieved 17 January 2024. Chang, Ailsa; Mohammad, Linah; Jarenwattananon, Patrick (22 March 2024). "As famine...
189 KB (19,322 words) - 05:06, 4 June 2025
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
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
sets, constructive solid geometry formulas for polygons, and visibility graphs of polygons. A simple polygon is a closed curve in the Euclidean plane consisting...
31 KB (3,206 words) - 07:42, 13 March 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
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
Multiple sequence alignment (section Graphing approach)
to use graphs to identify all of the different alignments. When finding alignments via graph, a complete alignment is created in a weighted graph that contains...
49 KB (6,213 words) - 12:51, 15 September 2024
Knowledge Graphs can be used. One can start with a set of documents, books, or other bodies of text, and convert them to a knowledge graph using one of...
23 KB (2,451 words) - 17:44, 2 June 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