Pages that link to "Item:Q3679229"

The following pages link to The Diameter of a Graph and its Complement (Q3679229):

Displaying 22 items.

• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
• On rainbow total-coloring of a graph (Q494442) (← links)
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts (Q642989) (← links)
• Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
• Proper connection numbers of complementary graphs (Q723592) (← links)
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (Q828980) (← links)
• The diameter of Hanoi graphs (Q844161) (← links)
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
• On the circumference of a graph and its complement (Q1045133) (← links)
• A simple relationship between the diameter and the radius of a graph (Q1122588) (← links)
• Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
• On conflict-free connection of graphs (Q1727736) (← links)
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
• On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
• On the eccentric complexity of graphs (Q2317938) (← links)
• A study on center of a graph complement (Q2788723) (← links)
• Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts (Q2890987) (← links)
• (Q3520883) (← links)
• Characterizing 2-distance graphs (Q4621402) (← links)
• A note on graph and its complement with specified properties: Radius, diameter, center, and periphery (Q4634293) (← links)
• A study on distance in graph complement (Q4965911) (← links)
• Further results on almost controllable graphs (Q6051129) (← links)