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 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 ...
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 spectrum of T is the set of all complex numbers ζ such that R ζ fails to exist or is unbounded. Often the spectrum of T is denoted by σ(T). The function R ζ for all ζ in ρ(T) (that is, wherever R ζ exists as a bounded operator) is called the resolvent of T. The spectrum of T is therefore the complement of the resolvent set of T in ...
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.
It is a graph whose adjacency matrix has largest eigenvalue at most 2, [1] or has spectral radius 2 [2] or at most 2. [3] The graphs with spectral radius 2 form two infinite families and three sporadic examples; if we ask for spectral radius at most 2 then there are two additional infinite families and three more sporadic examples.
Spectrochemistry is the application of spectroscopy in several fields of chemistry. It includes analysis of spectra in chemical terms, and use of spectra to derive the structure of chemical compounds, and also to qualitatively and quantitively analyze their presence in the sample.