Search Results for ""

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...