Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Locally Finite Self-Interchange Graphs

Benjamin L. Schwartz and Lowell W. Beineke
Proceedings of the American Mathematical Society
Vol. 27, No. 1 (Jan., 1971), pp. 8-12
DOI: 10.2307/2037249
Stable URL: http://www.jstor.org/stable/2037249
Page Count: 5
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Locally Finite Self-Interchange Graphs
Preview not available

Abstract

Graphs isomorphic to their interchanges are studied. Using prior results of more special cases, plus one new concept, it is possible to characterize all locally finite self-interchange graphs, finite and infinite, connected and disconnected, with loops and parallel edges admitted. All solutions are shown to be component-unions of graphs from six easily described classes.

Page Thumbnails

  • Thumbnail: Page 
8
    8
  • Thumbnail: Page 
9
    9
  • Thumbnail: Page 
10
    10
  • Thumbnail: Page 
11
    11
  • Thumbnail: Page 
12
    12