Search Results for ""

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

An ideal is a subset I of elements in a ring R that forms an additive group and has the property that, whenever x belongs to R and y belongs to I, then xy and yx belong to I. ...

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

In an additive group G, the additive inverse of an element a is the element a^' such that a+a^'=a^'+a=0, where 0 is the additive identity of G. Usually, the additive inverse ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

The angular acceleration alpha is defined as the time derivative of the angular velocity omega, alpha=(domega)/(dt)=(d^2theta)/(dt^2)z^^=(a)/r.