The Diameter of a Graph and its Complement
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2235179
- A generalisation of the diameter of a graph
- On the circumference of a graph and its complement
- The proper diameter of a graph
- scientific article; zbMATH DE number 3889563
- On the total distance and diameter of graphs
- Some properties of graphs of diameters
- scientific article; zbMATH DE number 1420446
- On diameter and inverse degree of a graph
- The diameter of directed graphs
Cited in
(30)- A Characterization of Graphs of Diameter Two
- Range of diameters of a bipartite graph and its generalized 2-partite complement
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- scientific article; zbMATH DE number 3957152 (Why is no real title available?)
- Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- A study on distance in graph complement
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- A note on graph and its complement with specified properties: Radius, diameter, center, and periphery
- A simple relationship between the diameter and the radius of a graph
- The diameter of Hanoi graphs
- The oriented diameter of graphs derived from other graphs
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
- On the eccentric complexity of graphs
- Characterizing 2-distance graphs
- The distance between a graph and its complement
- On conflict-free connection of graphs
- scientific article; zbMATH DE number 3889563 (Why is no real title available?)
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
- scientific article; zbMATH DE number 3943846 (Why is no real title available?)
- Further results on almost controllable graphs
- On rainbow total-coloring of a graph
- scientific article; zbMATH DE number 5316648 (Why is no real title available?)
- On zero-sum spanning trees and zero-sum connectivity
- On the circumference of a graph and its complement
- A study on center of a graph complement
- Proper connection numbers of complementary graphs
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs
- A Nordhaus-Gaddum problem for the spectral gap of a graph
This page was built for publication: The Diameter of a Graph and its Complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3679229)
