Computing distance moments on graphs with transitive Djoković-Winkler relation

DOI10.1016/j.dam.2013.10.006zbMath1283.05185OpenAlexW2030323032MaRDI QIDQ2636820

Sandi Klavžar, Mohammad Javad Nadjafi-Arani

Publication date: 18 February 2014

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

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

zbMATH Keywords

isometric embeddingWiener indexCartesian product of graphspartial cubedistance moment

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On partial cubes, well-graded families and their duals with some applications in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of Wiener polarity index and terminal Wiener index
• Wiener index of some graph operations
• Equiseparability on terminal Wiener index
• Calculating the edge Wiener and edge Szeged indices of graphs
• The Wiener index in iterated line graphs
• On some topological indices of the tensor products of graphs
• Isometric embedding in products of complete graphs
• Terminal Wiener index
• Partial cubes: Structures, characterizations, and constructions
• Netlike partial cubes, V: completion and netlike classes
• A theorem on Wiener-type invariants for isometric subgraphs of hypercubes
• Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
• Distance-preserving subgraphs of hypercubes
• An algorithm for the calculation of the hyper-Wiener index of benzenoid hydrocarbons