Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Eigenspaces of Graphs
  • Cited by 220
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      December 2011
      January 1997
      ISBN:
      9781139086547
      9780521573528
      9780521057189
      DOI:
      https://doi.org/10.1017/CBO9781139086547
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.534kg, 276 Pages
      Dimensions:
      (234 x 155 mm)
      Weight & Pages:
      0.398kg, 276 Pages
      • Subjects:
      Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding, Algebra
      Series:
      Encyclopedia of Mathematics and its Applications (66)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding, Algebra
    Series:
    Encyclopedia of Mathematics and its Applications (66)
    Information

    Book description

    Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labelling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. One objective is to describe graphs by algebraic means as far as possible, and the book discusses the Ulam reconstruction conjecture and the graph isomorphism problem in this context. Further problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.

    Reviews

    ‘Specialists in graph theory and mathematical chemistry will welcome this treatment of important new research.’

    Source: European Mathematical Society

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.