Search Results for ""

The Wiener index W, denoted w (Wiener 1947) and also known as the "path number" or Wiener number (Plavšić et al. 1993), is a graph index defined for a graph on n nodes by ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...

Rule 28 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

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

Graph Strength

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

A graph vertex in a graph is said to be an even node if its vertex degree is even.

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 condition for isoenergetic nondegeneracy for a Hamiltonian H=H_0(I)+epsilonH_1(I,theta) is |(partial^2H_0)/(partialI_ipartialI_j) (partialH_0)/(partialI_i); ...