Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
From MaRDI portal
Publication:642989
DOI10.1016/J.DAM.2011.06.016zbMATH Open1228.05138OpenAlexW1974759232MaRDI QIDQ642989FDOQ642989
Xunuan Yang, Baoyindureng Wu, Daobin Li, Xinhui An
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.016
Recommendations
- Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
- Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
- Nordhaus-Gaddum type result for the matching number of a graph
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Wiener index of trees: Theory and applications
- Radius, diameter, and minimum degree
- Distance in graphs
- On Complementary Graphs
- Molecular graphs and the inverse Wiener index problem
- Four new sums of graphs and their Wiener indices
- Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
- Title not available (Why is that?)
- Some nordhaus‐‐ gaddum‐type results
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Wiener indices of balanced binary trees
- Wiener index of graphs with more than one cut-vertex
- The Diameter of a Graph and its Complement
- Bounds on chromatic numbers of multiple factors of a complete graph
- On Harary index
- The Wiener index of the \(k\)th power of a graph
- Title not available (Why is that?)
- On reciprocal complementary Wiener number
- A map colour theorem for the union of graphs
Cited In (8)
- Some results on the reciprocal sum-degree distance of graphs
- On the relation between Wiener index and eccentricity of a graph
- Maximum size of digraphs with some parameters
- On conflict-free connection of graphs
- Monochromatic disconnection of graphs
- Nordhaus-Gaddum type result for the matching number of a graph
- Wiener index of graphs with radius two
- Nordhaus-Gaddum type inequality for the fractional matching number of a graph
This page was built for publication: Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642989)
