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...

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...

Graph neural networks (GNN) are specialized artificial neural networks that are designed for tasks whose inputs are graphs. One prominent example is molecular...

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...

that such a graph is perfect." Trivially perfect graphs are also known as comparability graphs of trees, arborescent comparability graphs, and quasi-threshold...

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...

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...

coloring. Explicit, though large, graphs with high girth and chromatic number can be constructed as certain Cayley graphs of linear groups over finite fields...

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...

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...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

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...

graphs, where there only exist one type of nodes and edges. However, the theory and methods for heterophily on heterogeneous graphs, temporal graphs and...

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...

path problem can be defined for graphs whether undirected, directed, or mixed. The definition for undirected graphs states that every edge can be traversed...

into graph database systems, May 2018 Hima Karanam, Sumit Neelam, Udit Sharma, Sumit Bhatia, Srikanta Bedathur, L. Venkata Subramaniam, Maria Chang, Achille...

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...

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...

entities. In general, networks or graphs are used to capture relationships between entities or objects. A typical graphing representation consists of a set...

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...

Archived from the original on 13 February 2024. Retrieved 17 January 2024. Chang, Ailsa; Mohammad, Linah; Jarenwattananon, Patrick (22 March 2024). "As famine...

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...

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...

sets, constructive solid geometry formulas for polygons, and visibility graphs of polygons. A simple polygon is a closed curve in the Euclidean plane consisting...

undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is...

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 ( |...

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...

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...

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...

knowledge graph's entities and relations while preserving their semantic meaning. Leveraging their embedded representation, knowledge graphs (KGs) can...