Search Results for ""

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

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

A special case of a flag manifold. A Grassmann manifold is a certain collection of vector subspaces of a vector space. In particular, g_(n,k) is the Grassmann manifold of ...

The dual of the uniform great rhombicosidodecahedron U_(67) and Wenninger dual W_(105).

The dual of the uniform great rhombicuboctahedron and Wenninger dual W_(85).