Search results
Results from the WOW.Com Content Network
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]
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 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 ...
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.
Another useful multifractal spectrum is the graph of () versus (see calculations). These graphs generally rise to a maximum that approximates the fractal dimension at Q=0, and then fall. Like D Q versus Q spectra, they also show typical patterns useful for comparing non-, mono-, and multi-fractal patterns.
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 ...
Graph Theory, 1736–1936 is a book in the history of mathematics on graph theory. It focuses on the foundational documents of the field, beginning with the 1736 paper of Leonhard Euler on the Seven Bridges of Königsberg and ending with the first textbook on the subject, published in 1936 by Dénes Kőnig .
Budan's theorem-- Budapest Semesters in Mathematics-- Buddhabrot-- Buekenhout geometry-- Bueno-Orovio–Cherry–Fenton model-- Buffer analysis-- Buffon's needle problem-- Buffon's noodle-- Bühlmann model-- Building (mathematics)-- Building automation-- Bulgarian solitaire-- Bulirsch–Stoer algorithm-- Bulk queue-- Bull graph-- Bullet-nose ...