Search results
Results from the WOW.Com Content Network
Brouwer has confirmed by computation that the conjecture is valid for all graphs with at most 10 vertices. [1] It is also known that the conjecture is valid for any number of vertices if t = 1, 2, n − 1, and n. For certain types of graphs, Brouwer's conjecture is known to be valid for all t and for any number of vertices
The 1980 monograph Spectra of Graphs [16] by Cvetković, Doob, and Sachs summarised nearly all research to date in the area. In 1988 it was updated by the survey Recent Results in the Theory of Graph Spectra. [17] The 3rd edition of Spectra of Graphs (1995) contains a summary of the further recent contributions to the subject. [15]
Andries Brouwer and Hendrik van Maldeghem (see #References) use an alternate but fully equivalent definition of a strongly regular graph based on spectral graph theory: a strongly regular graph is a finite regular graph that has exactly three eigenvalues, only one of which is equal to the degree k, of multiplicity 1.
The Brouwer–Haemers graph is the first in an infinite family of Ramanujan graphs defined as generalized Paley graphs over fields of characteristic three. [2] With the 3 × 3 {\displaystyle 3\times 3} Rook's graph and the Games graph , it is one of only three possible strongly regular graphs whose parameters have the form ( ( n 2 + 3 n − 1 ...
In mathematics, spectral theory is an inclusive term for theories extending the eigenvector and eigenvalue theory of a single square matrix to a much broader theory of the structure of operators in a variety of mathematical spaces. [1] It is a result of studies of linear algebra and the solutions of systems of linear equations and their ...
Frank Dance's helical model of communication was initially published in his 1967 book Human Communication Theory. [161] [162] [163] It is intended as a response to and an improvement over linear and circular models by stressing the dynamic nature of communication and how it changes the participants. Dance sees the fault of linear models as ...
The degree of a map between general manifolds was first defined by Brouwer, [1] who showed that the degree is homotopy invariant and used it to prove the Brouwer fixed point theorem. Less general forms of the concept existed before Brouwer, such as the winding number and the Kronecker characteristic (or Kronecker integral). [2]
One of the main limitation of the Taylor diagram is the absence of explicit information about model biases. One approach suggested by Taylor (2001) was to add lines, whose length is equal to the bias to each data point. An alternative approach, originally described by Elvidge et al., 2014 [17], is to show the bias of the models via a color ...