Loading [a11y]/accessibility-menu.js
On the Exceptional Case in a Characterization of the Arcs of a Complete Graph | IBM Journals & Magazine | IEEE Xplore

On the Exceptional Case in a Characterization of the Arcs of a Complete Graph


Abstract:

It is known that a certain simple set of properties characterize the relationship of adjacency of the n(n − 1)/2 arcs of the complete graph of order n, when n ≠ 8, and th...Show More

Abstract:

It is known that a certain simple set of properties characterize the relationship of adjacency of the n(n − 1)/2 arcs of the complete graph of order n, when n ≠ 8, and that these properties are not a sufficient characterization when n = 8 (see [1], [2], [3], [4], and [7]). The present paper describes a method for enumerating all counter-examples when n = 8.
Published in: IBM Journal of Research and Development ( Volume: 4, Issue: 5, November 1960)
Page(s): 487 - 496
Date of Publication: November 1960

ISSN Information:

General Electric Company, N, NY

General Electric Company, N, NY

Contact IEEE to Subscribe