The Diameter of a Graph and its Complement
From MaRDI portal
Publication:3679229
DOI10.2307/2322878zbMath0565.05046OpenAlexW4236846827MaRDI QIDQ3679229
Frank Harary, Robert W. Robinson
Publication date: 1985
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2322878
Related Items (18)
An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ⋮ Nordhaus-Gaddum-type theorem for rainbow connection number of graphs ⋮ Further results on almost controllable graphs ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ Nordhaus-Gaddum-type theorem for total-proper connection number of graphs ⋮ Characterizing 2-distance graphs ⋮ On conflict-free connection of graphs ⋮ 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 ⋮ On rainbow total-coloring of a graph ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ A study on center of a graph complement ⋮ Proper connection numbers of complementary graphs ⋮ A study on distance in graph complement ⋮ On the eccentric complexity of graphs ⋮ On zero-sum spanning trees and zero-sum connectivity
This page was built for publication: The Diameter of a Graph and its Complement
