enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Brouwer's conjecture - Wikipedia

    en.wikipedia.org/wiki/Brouwer's_conjecture

    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

  3. Brouwer–Haemers graph - Wikipedia

    en.wikipedia.org/wiki/Brouwer–Haemers_graph

    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 ...

  4. Strongly regular graph - Wikipedia

    en.wikipedia.org/wiki/Strongly_regular_graph

    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.

  5. Spectral graph theory - Wikipedia

    en.wikipedia.org/wiki/Spectral_graph_theory

    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]

  6. Adjacency matrix - Wikipedia

    en.wikipedia.org/wiki/Adjacency_matrix

    The adjacency matrix of an undirected simple graph is symmetric, and therefore has a complete set of real eigenvalues and an orthogonal eigenvector basis. The set of eigenvalues of a graph is the spectrum of the graph. [7]

  7. Brouwer fixed-point theorem - Wikipedia

    en.wikipedia.org/wiki/Brouwer_fixed-point_theorem

    [13] Brouwer "flattens" his sheet as with a flat iron, without removing the folds and wrinkles. Unlike the coffee cup example, the crumpled paper example also demonstrates that more than one fixed point may exist. This distinguishes Brouwer's result from other fixed-point theorems, such as Stefan Banach's, that guarantee uniqueness.

  8. Accounting Horizons - Wikipedia

    en.wikipedia.org/wiki/Accounting_Horizons

    Accounting Horizons is a quarterly peer-reviewed academic journal published by the American Accounting Association. It was established in 1987. It was established in 1987. The Association yearly presents the Accounting Horizons and Issues in Accounting Education Best Paper Awards.

  9. Philippe De Brouwer - Wikipedia

    en.wikipedia.org/wiki/Philippe_De_Brouwer

    Philippe J.S. De Brouwer (born 21 February 1969) is a European investment and banking professional as well as academician in finance and investing. As a scientist he is mostly known for his solution to the Fallacy of Large Numbers (formulated by Paul A Samuelson in 1963) and his formulation of the Maslowian Portfolio Theory in the field of investment advice (and annex theory Target Oriented ...