enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Spectral graph theory - Wikipedia

    en.wikipedia.org/wiki/Spectral_graph_theory

    Spectral graph theory emerged in the 1950s and 1960s. Besides graph theoretic research on the relationship between structural and spectral properties of graphs, another major source was research in quantum chemistry , but the connections between these two lines of work were not discovered until much later. [ 15 ]

  3. Algebraic graph theory - Wikipedia

    en.wikipedia.org/wiki/Algebraic_graph_theory

    Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric, combinatoric, or algorithmic approaches. There are three main branches of algebraic graph theory, involving the use of linear algebra, the use of group theory, and the study of graph invariants.

  4. Pearls in Graph Theory - Wikipedia

    en.wikipedia.org/wiki/Pearls_in_Graph_Theory

    The "pearls" of the title include theorems, proofs, problems, and examples in graph theory.The book has ten chapters; after an introductory chapter on basic definitions, the remaining chapters material on graph coloring; Hamiltonian cycles and Euler tours; extremal graph theory; subgraph counting problems including connections to permutations, derangements, and Cayley's formula; graph ...

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

  6. Alon–Boppana bound - Wikipedia

    en.wikipedia.org/wiki/Alon–Boppana_bound

    In spectral graph theory, the Alon–Boppana bound provides a lower bound on the second-largest eigenvalue of the adjacency matrix of a -regular graph, [1] meaning a graph in which every vertex has degree .

  7. Laplacian matrix - Wikipedia

    en.wikipedia.org/wiki/Laplacian_matrix

    The Laplacian matrix is the easiest to define for a simple graph, but more common in applications for an edge-weighted graph, i.e., with weights on its edges — the entries of the graph adjacency matrix. Spectral graph theory relates properties of a graph to a spectrum, i.e., eigenvalues, and eigenvectors of matrices associated with the graph ...

  8. Ramanujan graph - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_graph

    As Murty's survey paper [1] notes, Ramanujan graphs "fuse diverse branches of pure mathematics, namely, number theory, representation theory, and algebraic geometry". These graphs are indirectly named after Srinivasa Ramanujan; their name comes from the Ramanujan–Petersson conjecture, which was used in a construction of some of these graphs.

  9. Spectral theory - Wikipedia

    en.wikipedia.org/wiki/Spectral_theory

    The name spectral theory was introduced by David Hilbert in his original formulation of Hilbert space theory, which was cast in terms of quadratic forms in infinitely many variables. The original spectral theorem was therefore conceived as a version of the theorem on principal axes of an ellipsoid , in an infinite-dimensional setting.