A Characterization of Graphs of Diameter Two
From MaRDI portal
Recommendations
Cited in
(16)- A characterization for 2-self-centered graphs
- Range of diameters of a bipartite graph and its generalized 2-partite complement
- Classification of graphs of diameter 2
- A characterization of the non-trivial diameter two graphs of minimum size
- A Paley-like graph in characteristic two
- scientific article; zbMATH DE number 3943846 (Why is no real title available?)
- scientific article; zbMATH DE number 3957152 (Why is no real title available?)
- scientific article; zbMATH DE number 165093 (Why is no real title available?)
- Characterization of graphs with hall number 2
- Characterizing 2-distance graphs
- scientific article; zbMATH DE number 871174 (Why is no real title available?)
- A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
- Steiner 4-diameter, maximum degree and size of a graph
- scientific article; zbMATH DE number 975363 (Why is no real title available?)
- scientific article; zbMATH DE number 6289202 (Why is no real title available?)
- Trees with large numbers of subtrees
This page was built for publication: A Characterization of Graphs of Diameter Two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812272)