Average distance is submultiplicative and subadditive with respect to the strong product of graphs

DOI10.1016/j.amc.2017.06.025zbMath1426.05146OpenAlexW2743495475MaRDI QIDQ1740151

Marcin Jurkiewicz

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.06.025

zbMATH Keywords

networksstrong productWiener indexaverage distance

Mathematics Subject Classification ID

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

Related Items (2)

On zero-error codes produced by greedy algorithms ⋮ Wreath product of a complete graph with a cyclic graph: topological indices and spectrum

Uses Software

• KronFit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wiener index of some graph operations
• Advances in network analysis and its applications. Selected papers based on the presentations at the seven workshops (2010--2012) on mathematics of networking (FP-NETS)
• The Wiener index in iterated line graphs
• Wiener index of Eulerian graphs
• Handbook of large-scale random networks
• Mean distance in a graph
• On the sum of all distances in composite graphs
• Network analysis. Methodological foundations.
• The Wiener index of the \(k\)th power of a graph
• Wiener and vertex PI indices of the strong product of graphs
• The Kronecker Product of Graphs
• The average distance and the independence number
• Distance in graphs
• Wiener index of strong product of graphs
• ON WIENER INDEX OF GRAPH COMPLEMENTS
• Networks

This page was built for publication: Average distance is submultiplicative and subadditive with respect to the strong product of graphs