Zelinka, Bohdan Edge-distance between isomorphism classes of graphs. (English) Zbl 0646.05035 Čas. Pěstování Mat. 112, 233-237 (1987). The graph whose vertex set is the set of all isomorphism classes of graphs with n vertices and in which two vertices are adjacent if and only if their edge-distance is equal to 1 is discussed. Reviewer: J.Schwarze Cited in 2 Documents MSC: 05C35 Extremal problems in graph theory Keywords:isomorphism classes; edge-distance PDFBibTeX XMLCite \textit{B. Zelinka}, Čas. Pěstování Mat. 112, 233--237 (1987; Zbl 0646.05035) Full Text: EuDML