Search Results for ""

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian cycle.

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

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

A point that lies on one of the sides of a triangle but is a not vertex.

A reflexive graph is a pseudograph such that each vertex has an associated graph loop.

Two triangles are similar if their triples of vertex angles are the same.

The vertex of an isosceles triangle having angle different from the two equal angles is called the apex of the isosceles triangle. The common polygon vertex at the top of a ...