In graph theory, a locally linear graph is an undirected graph in which every edge belongs to exactly one triangle. Equivalently, for each vertex of the...

graph of the regular icosahedron is claw-free because it is locally C5 and C5 has independence number two. The locally linear graphs are the graphs in...

local linearity of manifolds and create a mapping that preserves local neighbourhoods at every point of the underlying manifold. Locally-linear Embedding...

regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever λ = 1. A strongly regular graph is...

in random graphs. The Paley graph of order 9 is a locally linear graph, a rook's graph, and the graph of the 3-3 duoprism. The Paley graph of order 13...

piecewise linear or segmented function is a real-valued function of a real variable, whose graph is composed of straight-line segments. A piecewise linear function...

term locally finite has a number of different meanings in mathematics: Locally finite collection of sets in a topological space Locally finite graph Locally...

In graph theory, the Games graph is the largest known locally linear strongly regular graph. Its parameters as a strongly regular graph are (729,112,1...

prize for its solution. If such a graph exists, it would necessarily be a locally linear graph and a strongly regular graph with parameters (99,14,1,2). The...

In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected...

Y} are Hausdorff locally convex spaces with Y {\displaystyle Y} finite-dimensional then this list may be extended to include: the graph of F {\displaystyle...

triangular cacti. As well as being cactus graphs the triangular cacti are also block graphs and locally linear graphs. Triangular cactuses have the property...

analysis, the closed graph theorem is a result connecting the continuity of a linear operator to a topological property of their graph. Precisely, the theorem...

cubic symmetric graphs included this graph. The bipartite half of the Foster graph is a distance-regular graph and a locally linear graph. It is one of...

cuboctahedron may be constructed as the line graph of the cubical graph, making it becomes the locally linear graph. The 24 edges can be partitioned into 2...

strongly regular graph with parameters srg(27, 16, 10, 8). The intersection graph of the 27 lines on a cubic surface is a locally linear graph that is the...

graphs is indeed an NP-complete problem, minimal coloring of Interval graphs (including interference graphs) can be done in linear time (see Linear scan...

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...

function into a Hausdorff space has a closed graph (see § Closed graph theorem in point-set topology) Any linear map, L : X → Y , {\displaystyle L:X\to Y...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

that graph uniquely but are shared with a different graph, namely the Shrikhande graph (which is not a rook's graph). The Shrikhande graph is locally hexagonal;...

The Games graph is a strongly regular graph with 729 vertices. Every edge belongs to a unique triangle, so it is a locally linear graph, the largest...

lengths in cubic graphs The Erdős–Hajnal conjecture on large cliques or independent sets in graphs with a forbidden induced subgraph The linear arboricity conjecture...

his axioms to prove the Garnir–Wright closed graph theorem which states, among other things, that any linear map from an F-space to a TVS is continuous...

nonlinear techniques include manifold learning techniques such as Isomap, locally linear embedding (LLE), Hessian LLE, Laplacian eigenmaps, and methods based...

bipartite graphs with linear strong chromatic index. Equivalently, it concerns the density of a different class of graphs, the locally linear graphs in which...

lemma used nowadays and can be roughly stated as follows: every locally linear graph on n {\displaystyle n} vertices contains o ( n 2 ) {\displaystyle...

and edits it locally. This method can be used with the previous methods. Non-linear editing examples The leading professional non-linear editing software...

domain. A differentiable function is smooth (the function is locally well approximated as a linear function at each interior point) and does not contain any...

Coxeter (1982). The vertices and edges form the Perkel graph, the unique distance-regular graph with intersection array {6,5,2;1,1,3}, discovered by Manley...