Vol. 31, No. 2, 1969

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Infinite self-interchange graphs

Benjamin L. Schwartz

Vol. 31 (1969), No. 2, 497–504
Abstract

Let G be an unoriented graph. Let I(G) denote the interchange graph of G. If G = I(G), we shall say G is a self-interchange graph (SIG). If for some positive integer m 1, we have Im(G) = G, we shall say G is eventually self interchange (ESIG). This paper extends previous results to characterize all finite degree SIG’s and ESIG’s, (loops and parallel edges permitted), finite or infinite, connected or disconnected. It will be seen that when infinite graphs are considered, several earlier results change. For example, there are ESIG’s which are not SIG’s; and loop-free SIG’s which are not regular.

Mathematical Subject Classification
Primary: 05.40
Milestones
Received: 23 September 1968
Revised: 6 May 1969
Published: 1 November 1969
Authors
Benjamin L. Schwartz