Description

Book Synopsis
Provides an introduction to the inverse eigenvalue problem for graphs (IEP-$G$) and the related area of zero forcing, propagation, and throttling. The IEP-$G$ grew from the intersection of linear algebra and combinatorics and has given rise to a rich set of deep problems in that area as well as a breadth of ‘ancillary’ problems in related areas.

Table of Contents
  • Introduction to the inverse eigenvalue problem of a graph and zero forcing: Introduction to an motivation for the IEP-$G$
  • Zero forcing and maximum eigenvalue multiplicity
  • Strong properties, theory, and consequences: Implicit function theorem and strong properties
  • Consequences of the strong properties
  • Theoretical underpinnings of the strong properties
  • Further discussion of ancillary problems: Ordered multiplicity lists of a graph
  • Rigid linkages
  • Minimum number of district eigenvalues
  • Zero forcing, propagation time, and throttling: Zero forcing, variants, and related parameters
  • Propagation time and capture time
  • Throttling
  • Appendix A. Graph terminology and notation
  • Bibliography
  • Index

    Inverse Problems and Zero Forcing for Graphs

    Product form

    £98.10

    Includes FREE delivery

    RRP £109.00 – you save £10.90 (10%)

    Order before 4pm today for delivery by Thu 22 Jan 2026.

    A Paperback by Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader

    10 in stock


      View other formats and editions of Inverse Problems and Zero Forcing for Graphs by Leslie Hogben

      Publisher: MP-AMM American Mathematical
      Publication Date: 10/30/2022 12:00:00 AM
      ISBN13: 9781470466558, 978-1470466558
      ISBN10: 1470466554
      Also in:
      Combinatorics and graph theory

      Description

      Book Synopsis
      Provides an introduction to the inverse eigenvalue problem for graphs (IEP-$G$) and the related area of zero forcing, propagation, and throttling. The IEP-$G$ grew from the intersection of linear algebra and combinatorics and has given rise to a rich set of deep problems in that area as well as a breadth of ‘ancillary’ problems in related areas.

      Table of Contents
      • Introduction to the inverse eigenvalue problem of a graph and zero forcing: Introduction to an motivation for the IEP-$G$
      • Zero forcing and maximum eigenvalue multiplicity
      • Strong properties, theory, and consequences: Implicit function theorem and strong properties
      • Consequences of the strong properties
      • Theoretical underpinnings of the strong properties
      • Further discussion of ancillary problems: Ordered multiplicity lists of a graph
      • Rigid linkages
      • Minimum number of district eigenvalues
      • Zero forcing, propagation time, and throttling: Zero forcing, variants, and related parameters
      • Propagation time and capture time
      • Throttling
      • Appendix A. Graph terminology and notation
      • Bibliography
      • Index

        Recently viewed products

        © 2026 Book Curl

          • American Express
          • Apple Pay
          • Diners Club
          • Discover
          • Google Pay
          • Maestro
          • Mastercard
          • PayPal
          • Shop Pay
          • Union Pay
          • Visa

          Login

          Forgot your password?

          Don't have an account yet?
          Create account