Upper bounds on product degree distance of F-sum of graphs

DOI10.1142/S1793830919500459zbMath1420.05049OpenAlexW2953784492WikidataQ127592823 ScholiaQ127592823MaRDI QIDQ5197550

No author found.

Publication date: 18 September 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500459

zbMATH Keywords

Wiener indexdegree distanceproduct degree distance\(F\)-sum graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Four new sums of graphs and their Wiener indices
• Properties of connected graphs having minimum degree distance
• The behavior of Wiener indices and polynomials of graphs under five graph decorations
• Two upper bounds for the degree distances of four sums of graphs
• THE GUTMAN INDEX OF UNICYCLIC GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds on product degree distance of F-sum of graphs