Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts

DOI10.1142/S179383091100122XMaRDI QIDQ2890987zbMATH OpenFDO

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

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) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Nordhaus–Gaddum‐type Theorems for decompositions into many parts
• scientific article; zbMATH DE number 3339176
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• scientific article; zbMATH DE number 611230
• scientific article; zbMATH DE number 9573

Cites work

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

Cited in

(5)

• Some results on the reciprocal sum-degree distance of graphs
• The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
• Maximum size of digraphs with some parameters
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890987)