Housing Watch Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 .

  3. Chris Godsil - Wikipedia

    en.wikipedia.org/wiki/Chris_Godsil

    Chris Godsil. Christopher David Godsil is a professor and the former Chair at the Department of Combinatorics and Optimization in the faculty of mathematics at the University of Waterloo. He wrote the popular textbook on algebraic graph theory, entitled Algebraic Graph Theory, with Gordon Royle, [1] His earlier textbook on algebraic ...

  4. Perron–Frobenius theorem - Wikipedia

    en.wikipedia.org/wiki/Perron–Frobenius_theorem

    The theorem has particular use in algebraic graph theory. The "underlying graph" of a nonnegative n-square matrix is the graph with vertices numbered 1, ..., n and arc ij if and only if A ij ≠ 0. If the underlying graph of such a matrix is strongly connected, then the matrix is irreducible, and thus the theorem applies. In particular, the ...

  5. Category:Algebraic graph theory - Wikipedia

    en.wikipedia.org/.../Category:Algebraic_graph_theory

    Algebraic graph theory is a branch of graph theory . Wikimedia Commons has media related to Algebraic graph theory.

  6. Mac Lane's planarity criterion - Wikipedia

    en.wikipedia.org/wiki/Mac_Lane's_planarity_criterion

    Mac Lane's planarity criterion. In graph theory, Mac Lane's planarity criterion is a characterisation of planar graphs in terms of their cycle spaces, named after Saunders Mac Lane, who published it in 1937. It states that a finite undirected graph is planar if and only if the cycle space of the graph (taken modulo 2) has a cycle basis in which ...

  7. Miroslav Fiedler - Wikipedia

    en.wikipedia.org/wiki/Miroslav_Fiedler

    Miroslav Fiedler (7 April 1926 – 20 November 2015) was a Czech mathematician known for his contributions to linear algebra, graph theory and algebraic graph theory . His article, "Algebraic Connectivity of Graphs", published in the Czechoslovak Math Journal in 1973, established the use of the eigenvalues of the Laplacian matrix of a graph to ...

  8. List of graph theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_graph_theory_topics

    Total graph. Tree (graph theory). Trellis (graph) Turán graph. Ultrahomogeneous graph. Vertex-transitive graph. Visibility graph. Museum guard problem. Wheel graph.

  9. Babai's problem - Wikipedia

    en.wikipedia.org/wiki/Babai's_problem

    Babai's problem is a problem in algebraic graph theory first proposed in 1979 by László Babai. [1]