On reciprocal complementary Wiener number

DOI10.1016/j.dam.2008.09.010zbMath1163.92045OpenAlexW2003315965MaRDI QIDQ1028140

Nenad Trinajstić, Xiaochun Cai, Bo Zhou

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.09.010

zbMATH Keywords

upper and lower boundsconnected graphsreciprocal complementary Wiener numberNordhaus-Gaddum-type result

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (12)

NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ⋮ Consistency test and weight generation for additive interval fuzzy preference relations ⋮ On the variable Wiener indices of trees with given maximum degree ⋮ On min–max distance degree index ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts ⋮ On Harary index of graphs ⋮ Extremal properties of reciprocal complementary Wiener number of trees ⋮ Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs ⋮ On the \(k\)th smallest and \(k\)th greatest modified Wiener indices of trees ⋮ Unnamed Item ⋮ Distance and indices computation in chains and nanotubes model as graph discrete dynamica systems ⋮ Bounds on Harary index

Cites Work

• On Harary index
• On Complementary Graphs
• On the sum of all distances in a graph or digraph
• Diameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On reciprocal complementary Wiener number