Characterizing 2-distance graphs
From MaRDI portal
Recommendations
Cites work
- A Characterization of Graphs of Diameter Two
- A graph and its complement with specified properties. I: Connectivity
- A note on periodicity of the 2-distance operator
- Graph theory
- scientific article; zbMATH DE number 3843789 (Why is no real title available?)
- scientific article; zbMATH DE number 841619 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- scientific article; zbMATH DE number 6471182 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- Selbstkomplementäre Graphen
- Self 2-distance graphs
- The Diameter of a Graph and its Complement
Cited in
(9)- A characterization of graphs with regular distance-2 graphs
- Two-distance-primitive graphs
- On representations of graphs as two-distance sets
- Self 2-distance graphs
- On the connectivity of k-distance graphs
- scientific article; zbMATH DE number 7103402 (Why is no real title available?)
- scientific article; zbMATH DE number 975363 (Why is no real title available?)
- Graphs with parity conditions on distances between cut and noncut vertices
- Connectivity of 3-distance graphs
This page was built for publication: Characterizing 2-distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621402)