Search Results for ""

The tangent function is defined by tanx=(sinx)/(cosx), (1) where sinx is the sine function and cosx is the cosine function. The notation tgx is sometimes also used ...

The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...

A diagonal matrix D=diag(d_1,...,d_n) sometimes also called the valency matrix corresponding to a graph that has the vertex degree of d_i in the ith position (Skiena 1990, p. ...

A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...

A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...

The shortest path problem seeks to find the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u,v) of a directed or undirected graph. The length of the ...

The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...

The tritetrahedron, also called the "boat polyhedron," is the name given in this work to the concave (non-regular) octahedron formed by joining three regular tetrahedra ...

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...