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

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...

k: that is, some vertex in the subgraph touches k or fewer of the subgraph's edges. The degeneracy of a graph is the smallest value of k for which it...

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

a topological graph cross a finite number of times, no edge passes through a vertex different from its endpoints, and no two edges touch each other (without...

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...

visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents...

edge for each two pennies that touch. Penny graphs have also been called unit coin graphs, because they are the coin graphs formed from unit circles. If...

interfaces and tools which enable developers to integrate with the open "social graph" of personal relations and other things like songs, places, and Facebook...

differently from regions it touches directly, not regions touching regions that it touches. If this were the restriction, planar graphs would require arbitrarily...

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

The social graph is a graph that represents social relations between entities. In short, it is a model or representation of a social network, where the...

differentiable curve can also be thought of as a tangent line approximation, the graph of the affine function that best approximates the original function at the...

according to the rules of graph coloring. With each move, the graph must remain proper (no two areas of the same colour may touch), and a player who cannot...

Force Touch is a haptic pressure-sensing technology developed by Apple Inc. that enables trackpads and touchscreens to sense the amount of force being...

Oculus Touch is a line of motion controller systems used by Meta Platforms (formerly Oculus) virtual reality headsets. The controller was first introduced...

Behind Your Touch (Korean: 힙하게) is a 2023 South Korean television series starring Han Ji-min, Lee Min-ki, and Suho. It aired on JTBC from August 12, to...

graph—its edges remain connected whenever two of more three vertices of a graph are removed. Its graph called the octahedral graph, a Platonic graph....

pursuit–evasion game on the graph, or in terms of the maximum order of a bramble, a collection of connected subgraphs that all touch each other. Treewidth is...

In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs...

then it has a set of edges that touches every vertex exactly once. We show that for every cubic, bridgeless graph G = (V, E) we have that for every...

of graph are well-covered is a coNP-complete problem. A vertex cover in an undirected graph is a set of vertices that touches every edge in the graph. A...

In mechanics, the derivative of the position vs. time graph of an object is equal to the velocity of the object. In the International System of Units...

In graph theory, a branch of mathematics, a map graph is an undirected graph formed as the intersection graph of finitely many simply connected and internally...

regions that all touch each other – three along the boundary of the strip and three along its center line – and therefore that graphs that are embedded...

Accidental Billionaires The Social Network Concepts Activity stream Social graph Friending and following Reblogging Fan-gating Facebook diplomacy Facebook...

each vertex touches exactly three edges – had already been studied over a century earlier by Kirkman. Halin graphs are polyhedral graphs, meaning that...

In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges...

automatically using graph drawing techniques. In some sources, the phrase "Hasse diagram" has a different meaning: the directed acyclic graph obtained from...

geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. That is, it is a graph with one vertex...