Search Results for ""

The triangular grid graph T_n is the lattice graph obtained by interpreting the order-(n+1) triangular grid as a graph, with the intersection of grid lines being the vertices ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...

The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...