Distances Between Graphs (Extended Abstract)

Simple item page
dc.contributor.authorZelinka, Bohdan
dc.date.accessioned2015-10-26
dc.date.available2015-10-26
dc.date.issued1992
dc.description.abstractThis 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.en
dc.formattext
dc.identifier.doi10.1016/S0167-5060(08)70656-3
dc.identifier.issn0167-5060
dc.identifier.scopus2-s2.0-77957045938
dc.identifier.urihttps://dspace.tul.cz/handle/15240/13337
dc.identifier.urihttps://www.sciencedirect.com/science/article/abs/pii/S0167506008706563
dc.language.isoen
dc.publisherTechnical university of Liberec, Czech Republicen
dc.publisherTechnická Univerzita v Libercics
dc.relation.ispartofAnnals of Discrete Mathematicsen
dc.sourcej-scopus
dc.sourcej-wok
dc.sourcej-scopus
dc.titleDistances Between Graphs (Extended Abstract)en
dc.typeArticle
local.accessοpen
local.citation.epage361
local.citation.spage355
local.departmentDepartment of Mathematics
local.facultyFaculty of Sciences, Humanities and Education
local.relation.issueC
local.relation.volume51
Files
Collections