Topological efficiency under graph operations

DOI10.1007/S12190-016-0997-8MaRDI QIDQ1676969zbMATH OpenOpenAlexFDO

Authors M. Tavakoli, S. Hossein-Zadeh, A. Iranmanesh, M. A. Hosseinzadeh, A. Hamzeh, A. R. Ashrafi

Publication date 10 November 2017

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-016-0997-8

zbMATH Keywords

graph operationmolecular graphtopological efficiency

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Combinatorial inequalities (05A20)

Recommendations

• Some bounds for topological efficiency of graphs
• Topological efficiency of some product graphs
• Computing the eccentric-distance sum for graph operations
• Topological indices and new graph structures
• Some vertex-degree-based topological indices of graph operations.

Cites work

• scientific article; zbMATH DE number 5619543 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 6271722 (Why is no real title available?)
• Applications of graph operations
• Distribution of some graph invariants over hierarchical product of graphs
• Graph theory
• On the sum of all distances in composite graphs
• The Wiener, eccentric connectivity and Zagreb indices of the hierarchical product of graphs
• The generalized hierarchical product of graphs
• The hierarchical product of graphs
• Wiener-type invariants of some graph operations

Cited in

(6)

• Local metric dimension of graphs: generalized hierarchical products and some applications
• Some bounds for topological efficiency of graphs
• Global efficiency of graphs
• Eccentric connectivity coindex under graph operations
• Topological efficiency of some product graphs
• General transmission lemma and Wiener complexity of triangular grids

This page was built for publication: Topological efficiency under graph operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676969)