TOPICS
Search

Search Results for ""


111 - 120 of 1013 for neighborhood of vertexSearch Results
A function is called locally integrable if, around every point in the domain, there is a neighborhood on which the function is integrable. The space of locally integrable ...
A point x in a manifold M is said to be nonwandering if, for every open neighborhood U of x, it is true that phi^nU intersection U!=emptyset for a map phi for some n>0. In ...
A topological space X has a one-point compactification if and only if it is locally compact. To see a part of this, assume Y is compact, y in Y, X=Y\{y} and x in X. Let C be ...
A subset M subset R^n is called a regular surface if for each point p in M, there exists a neighborhood V of p in R^n and a map x:U->R^n of an open set U subset R^2 onto V ...
A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...
Let S be a subset of a metric space. Then the set S is open if every point in S has a neighborhood lying in the set. An open set of radius r and center x_0 is the set of all ...
Over a small neighborhood U of a manifold, a vector bundle is spanned by the local sections defined on U. For example, in a coordinate chart U with coordinates (x_1,...,x_n), ...
Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...
The shortest path-spanning tree from a graph vertex of a graph.
A polygon whose vertex angles are equal (Williams 1979, p. 32).
1 ... 9|10|11|12|13|14|15 ... 102 Previous Next

...