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.016zbMath1228.05138OpenAlexW1974759232MaRDI QIDQ642989
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (8)
Maximum size of digraphs with some parameters ⋮ Nordhaus-Gaddum type result for the matching number of a graph ⋮ Wiener index of graphs with radius two ⋮ Monochromatic disconnection of graphs ⋮ On conflict-free connection of graphs ⋮ Some results on the reciprocal sum-degree distance of graphs ⋮ On the relation between Wiener index and eccentricity of a graph ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Harary index
- Wiener indices of balanced binary trees
- Wiener index of graphs with more than one cut-vertex
- Molecular graphs and the inverse Wiener index problem
- On reciprocal complementary Wiener number
- Four new sums of graphs and their Wiener indices
- Radius, diameter, and minimum degree
- The Wiener index of the \(k\)th power of a graph
- A map colour theorem for the union of graphs
- NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS
- On Complementary Graphs
- The Diameter of a Graph and its Complement
- Some nordhaus‐‐ gaddum‐type results
- Distance in graphs
- Bounds on chromatic numbers of multiple factors of a complete graph
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Wiener index of trees: Theory and applications
This page was built for publication: Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
