Search Results for ""

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

A minimal free resolution of a finitely generated graded module M over a commutative Noetherian Z-graded ring R in which all maps are homogeneous module homomorphisms, i.e., ...

The energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...

The ABC (atom-bond connectivity) energy of a graph is defined as the graph energy of its ABC matrix, i.e., the sum of the absolute values of the eigenvalues of its ABC matrix.

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

Let Omega be a space with measure mu>=0, and let Phi(P,Q) be a real function on the product space Omega×Omega. When (mu,nu) = intintPhi(P,Q)dmu(Q)dnu(P) (1) = ...

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.

A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...

Let h be a real-valued harmonic function on a bounded domain Omega, then the Dirichlet energy is defined as int_Omega|del h|^2dx, where del is the gradient.