Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
From MaRDI portal
Publication:2890987
DOI10.1142/S179383091100122XzbMATH Open1242.05078MaRDI QIDQ2890987FDOQ2890987
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)
Recommendations
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory with applications
- Radius, diameter, and minimum degree
- On Complementary Graphs
- Some nordhaus‐‐ gaddum‐type results
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Relations between parameters of a graph
- The Diameter of a Graph and its Complement
- Bounds on chromatic numbers of multiple factors of a complete graph
- On Harary index
- On reciprocal complementary Wiener number
- A map colour theorem for the union of graphs
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 Theorems for decompositions into many parts
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three 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)
