Vol. 27, No. 2, 1968

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 297: 1
Vol. 296: 1  2
Vol. 295: 1  2
Vol. 294: 1  2
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Online Archive
The Journal
Editorial Board
Special Issues
Submission Guidelines
Submission Form
Author Index
To Appear
ISSN: 0030-8730
On interchange graphs

Benjamin L. Schwartz

Vol. 27 (1968), No. 2, 393–396

The interchange graph I(G) for an unoriented graph G has been defined by Ore as follows: The vertices of I(G) are the edges of G; and two vertices of I(G) are connected by an edge if and only if they are adjacent (i.e., have a vertex in common) in G. In 1962 Ore raised the problem of determining those graphs for which

I(G ) = G.

This paper solves this problem for finite connected graphs with loops and parallel edges, extending earlier work on the problem.

A loop (an edge whose two ends coincide in a single vertex) is considered adjacent to itself, and hence generates another loop under the I mapping. If two edges of G connect the same two vertices, the corresponding vertices of I(G) are also connected by two distinct edges.

Mathematical Subject Classification
Primary: 05.40
Received: 26 June 1967
Published: 1 November 1968
Benjamin L. Schwartz