enow.com Web Search

  1. Ads

    related to: spectral graph theory chung pdf file editor converter

Search results

  1. Results from the WOW.Com Content Network
  2. Fan Chung - Wikipedia

    en.wikipedia.org/wiki/Fan_Chung

    Fan-Rong King Chung Graham (Chinese: 金芳蓉; pinyin: Jīn Fāngróng; born October 9, 1949), known professionally as Fan Chung, is a Taiwanese-born American mathematician who works mainly in the areas of spectral graph theory, extremal graph theory and random graphs, in particular in generalizing the Erdős–Rényi model for graphs with general degree distribution (including power-law ...

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

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

  5. Graph Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Graph_Fourier_transform

    Analogously to the classical Fourier transform, graph Fourier transform provides a way to represent a signal in two different domains: the vertex domain and the graph spectral domain. Note that the definition of the graph Fourier transform and its inverse depend on the choice of Laplacian eigenvectors, which are not necessarily unique. [3]

  6. Ramanujan graph - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_graph

    In the mathematical field of spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are excellent spectral expanders .

  7. Brouwer's conjecture - Wikipedia

    en.wikipedia.org/wiki/Brouwer's_conjecture

    It was also proved that Brouwer’s conjecture holds for two large families of graphs; the first family of graphs is obtained from a clique by identifying each of its vertices to a vertex of an arbitrary c-cyclic graph, and the second family is composed of the graphs in which the removal of the edges of the maximal complete bipartite subgraph ...

  1. Ads

    related to: spectral graph theory chung pdf file editor converter