The distance between a graph and its complement

DOI10.21136/CMJ.1987.102139MaRDI QIDQ3768937zbMATH OpenOpenAlexFDO

Authors Bohdan Zelinka

Publication date 1987

Full work available at URL https://eudml.org/doc/13625

zbMATH Keywords

distance between two graphsinduced subgraphself-complementary graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• On mean distance in certain classes of graphs
• Graphs self-complementary in \(K_ n-e\)
• The Diameter of a Graph and its Complement
• The diameter and the chromatic number of almost self-complementary graphs.
• scientific article; zbMATH DE number 5316648

Cites work

• Edge-distance between isomorphism classes of graphs
• scientific article; zbMATH DE number 3194323 (Why is no real title available?)
• On a certain distance between isomorphism classes of graphs
• Selbstkomplementäre Graphen

Cited in

(1)

• scientific article; zbMATH DE number 5316648 (Why is no real title available?)

This page was built for publication: The distance between a graph and its complement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768937)