Distances Between Graphs (Extended Abstract)
Date
1992
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Technical university of Liberec, Czech Republic
Technická Univerzita v Liberci
Technická Univerzita v Liberci
Abstract
This chapter describes distances between isomorphism classes or distances between graphs. An isomorphism class of graphs is the class of all graphs that are isomorphic to a given graph. Two graphs whose distance is zero need not be identical but are isomorphic. A self-complementary graph is a graph that is isomorphic to its own complement. These graphs were studied independently by G. Ringel and H. Saclis. For the number n of vertices of a self-complementary graph, n 0 (mod 4) or n 1 (mod 4) always holds. An almost self-complementary graph can be defined as a graph that is isomorphic to a graph obtained from its complement by adding or deleting one edge.
Description
Subject(s)
Citation
ISSN
0167-5060