Search Results for ""

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G ...

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

For a graph G and a subset S^t of the vertex set V(G), denote by N_G^t[S^t] the set of vertices in G which are adjacent to a vertex in S^t. If N_G^t[S^t]=V(G), then S^t is ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

The (n,k)-arrangement graph A_(n,k) is defined as the graph on the vertex set consisting of the permutations of {1,2,...,n} containing at most k elements where vertices are ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...