Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts

DOI10.1016/j.tcs.2012.10.049zbMath1258.05100OpenAlexW2050781474MaRDI QIDQ1935819

Daobin Li, Yi Sun, Guifu Su, Limning Xiong

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.049

zbMATH Keywords

Wiener indexhyper-Wiener index\(k\)-decompositionNordhaus-Gaddum-type inequality

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Nordhaus-Gaddum type result for the matching number of a graph ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph

This page was built for publication: Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts