Search Results for ""

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The mathematical study of the properties of the formal mathematical structures called graphs.

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

The multiplicity of a multigraph is its maximum edge multiplicity.

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

The Erdős number is the number of "hops" needed to connect the author of a paper with the prolific late mathematician Paul Erdős. An author's Erdős number is 1 if he has ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.