Search Results for ""

A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...

The arithmetic-geometric spectral radius rho_(AG) of a graph is defined as the largest eigenvalue of its arithmetic-geometric matrix.

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...

The neighborhood complex N(G) of a locally finite graph G is defined as the abstract simplicial complex formed by the subsets of the neighborhoods of all vertices of G.

The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

The 12-vertex graph consisting of a cube in which two opposite faces (say, top and bottom) have edges drawn across them which connect the centers of opposite sides of the ...

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...