nonadjacent

In some cases speakers of nonadjacent dialects may not understand each other's speech.

Thus, the relationship between two disjoint modules is either adjacent or nonadjacent.

Let G be a finite undirected graph and x and y two nonadjacent vertices.

In graph theory, the word independent usually carries the connotation of pairwise disjoint or mutually nonadjacent.

If two pentagonal pyramids are removed to form nonadjacent pentagonal faces, the result is instead the pentagonal antiprism.

Any two vertices in a rook's graph are either at distance one or two from each other, according to whether they are adjacent or nonadjacent respectively.

If one of these moving vertices collides with a nonadjacent edge, the polygon is split in two by the collision, and the process continues in each part.

Each channel consists of two redundantly paired tracks, and the paired tracks are nonadjacent to minimize the effect of contamination on the tape surface.

WWE then reinserted Saturday Night's Main Event on their schedule in 2006, albeit for only two nonadjacent days.

Metathesis may also involve switching non-contiguous sounds, known as nonadjacent metathesis, long-distance metathesis, or hyperthesis:

As showed, every k-critical graph may be formed from a complete graph K by combining the Hajós construction with an operation of identifying two nonadjacent vertices.

A special case of crossed quadrilaterals are the antiparallelograms, crossed quadrilaterals in which (like a parallelogram) each pair of nonadjacent sides has equal length.

This DOC is broken into two near but nonadjacent areas that envelop Lucca and are separated by the Serchio River.

Adjacent dialects typically have relatively high degrees of mutual intelligibility, but the degree of mutual intelligibility between nonadjacent dialects varies considerably.

As the name suggests, it can be constructed by doubly augmenting a pentagonal prism by attaching square pyramids (J) to two of its nonadjacent equatorial faces.

Any two nonadjacent vertices may be transformed into any other two nonadjacent vertices by a symmetry of the graph.

In this case, Lovász shows that one can find a spanning tree such that two nonadjacent neighbors u and w of the root v are leaves in the tree.

Moreover, except for complete graphs, κ(G) equals the minimum of κ(u,v) over all nonadjacent pairs of vertices u, v.

In graph theory, a vertex subset is a vertex separator for nonadjacent vertices and if the removal of from the graph separates and into distinct connected components.

Some optional enhanced channel rejection requirements (for both adjacent and nonadjacent channels) are specified in this amendment in order to improve the immunity of the communication system to out-of-channel interferences.

However, the relatively low degrees of mutual intelligibility between some nonadjacent Ojibwe dialects led to the suggestion that Ojibwe "...could be said to consist of several languages...".

The biadjacency matrix of a bipartite graph is a -matrix of size that has a one for each pair of adjacent vertices and a zero for nonadjacent vertices.

Equivalently, a polygon is strictly convex if every line segment between two nonadjacent vertices of the polygon is strictly interior to the polygon except at its endpoints.

The claim proves that one can partition the vertices of into equivalence classes based on their nonneighbors; i.e. two vertices are in the same equivalence class if they are nonadjacent.

By an argument similar to the one in the proof of the theorem, the desired index j must exist, or else the nonadjacent vertices v and v would have too small a total degree.