Search Results for ""

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

The word "base" in mathematics is used to refer to a particular mathematical object that is used as a building block. The most common uses are the related concepts of the ...

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...

In general, an integer n is divisible by d iff the digit sum s_(d+1)(n) is divisible by d. Write a positive decimal integer a out digit by digit in the form ...

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The thickness (or depth) t(G) (Skiena 1990, p. 251; Beineke 1997) or theta(G) (Harary 1994, p. 120) of a graph G is the minimum number of planar edge-induced subgraphs P_i of ...

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 Kronecker symbol is an extension of the Jacobi symbol (n/m) to all integers. It is variously written as (n/m) or (n/m) (Cohn 1980; Weiss 1998, p. 236) or (n|m) (Dickson ...