NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS

DOI10.1142/S179383091100122XzbMath1242.05078MaRDI QIDQ2890987

Guifu Su, Yun Wang, Baoyindureng Wu, Zhihua An, Daobin Li

Publication date: 12 June 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

decompositiondistancediameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (4)

Maximum size of digraphs with some parameters ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ Some results on the reciprocal sum-degree distance of graphs ⋮ The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs

Cites Work

• Unnamed Item
• On Harary index
• Relations between parameters of a graph
• On reciprocal complementary Wiener number
• Radius, diameter, and minimum degree
• A map colour theorem for the union of graphs
• On Complementary Graphs
• The Diameter of a Graph and its Complement
• Some nordhaus‐‐ gaddum‐type results
• Bounds on chromatic numbers of multiple factors of a complete graph
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts

This page was built for publication: NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS