Distances Between Graphs (Extended Abstract)

DSpace Repository

Show simple item record

dc.contributor.author Zelinka, Bohdan
dc.date.accessioned 2015-10-26
dc.date.available 2015-10-26
dc.date.issued 1992
dc.identifier.issn 0167-5060
dc.identifier.uri https://dspace.tul.cz/handle/15240/13337
dc.identifier.uri https://www.sciencedirect.com/science/article/abs/pii/S0167506008706563
dc.description.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. en
dc.format text
dc.language.iso en
dc.publisher Technical university of Liberec, Czech Republic en
dc.publisher Technická Univerzita v Liberci cs
dc.relation.ispartof Annals of Discrete Mathematics en
dc.source j-scopus
dc.source j-wok
dc.source j-scopus
dc.title Distances Between Graphs (Extended Abstract) en
dc.type Article
dc.identifier.doi 10.1016/S0167-5060(08)70656-3
local.relation.volume 51
local.relation.issue C
local.identifier.scopus 2-s2.0-77957045938
local.faculty Faculty of Sciences, Humanities and Education
local.citation.spage 355
local.citation.epage 361
local.department Department of Mathematics
local.access οpen

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account