Search Results for ""

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 ...

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

A fractional clique of a graph G is a nonnegative real function on the vertices of G such that sum of the values on the vertices of any independent set is at most one. The ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose endpoints are both in this ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...