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 ...
Many models of communication include the idea that a sender encodes a message and uses a channel to transmit it to a receiver. Noise may distort the message along the way. The receiver then decodes the message and gives some form of feedback. [1] Models of communication simplify or represent the process of communication.
Luitzen Egbertus Jan "Bertus" Brouwer [a] (27 February 1881 – 2 December 1966) was a Dutch mathematician and philosopher who worked in topology, ...
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 ...
This second branch of algebraic graph theory is related to the first, since the symmetry properties of a graph are reflected in its spectrum. In particular, the spectrum of a highly symmetrical graph, such as the Petersen graph, has few distinct values [ 1 ] (the Petersen graph has 3, which is the minimum possible, given its diameter).