Four new sums of graphs and their Wiener indices

DOI10.1016/j.dam.2008.07.001zbMath1172.05318MaRDI QIDQ1028476

Bijan Taeri, Mehdi Eliasi

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.07.001

zbMATH Keywords

distance; Wiener index; operations on graphs

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C12: Distance in graphs

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

The sharp bounds on general sum-connectivity index of four operations on graphs, Maximum size of digraphs with some parameters, Wiener index of some graph operations, Semi-Cartesian product of graphs, The hyper-Wiener index of the generalized hierarchical product of graphs, Wiener and vertex \(PI\) indices of Kronecker products of graphs, Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts, Vertex PI indices of four sums of graphs, The bipartite edge frustration of graphs under subdivided edges and their related sums, Dependence polynomials of some graph operations, Hyper- and reverse-Wiener indices of F-sums of graphs, Schultz indices of F-sums graphs

Cites Work

• Average distances in undirected graphs and the removal of vertices
• Average distance and independence number
• On the sum of all distances in composite graphs
• The behavior of Wiener indices and polynomials of graphs under five graph decorations
• On the sum of all distances in a graph or digraph
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item