Search Results for ""

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A node which is one graph edge further away from a given node in a rooted tree.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

The Tutte 12-cage, also called the Benson graph (Exoo and Jajcay 2008), is the unique 12-cage graph, equivalent to the generalized hexagon GH(2,2) and alternately called the ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

Every nonplanar graph contains either the utility graph K_(3,3) (i.e., the complete bipartite graph on two sets of three vertices) or the pentatope graph K_5 as a ...

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

The Pasch configuration is the unbalanced (6_2,4_3) configuration (since there are two lines through each of six points and three points on each of four lines) illustrated ...