Search Results for ""

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

The Wiener sum index WS is a graph index defined for a graph on n nodes by WS=1/2sum_(i=1)^nsum_(j=1)^n((d)_(ij))/((Omega)_(ij)), where (d)_(ij) is the graph distance matrix ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

Graph Strength