Topological efficiency under graph operations
DOI10.1007/S12190-016-0997-8zbMATH Open1373.05158OpenAlexW2283846962MaRDI QIDQ1676969FDOQ1676969
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
Recommendations
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)
Cites Work
- Graph theory
- Title not available (Why is that?)
- On the sum of all distances in composite graphs
- Distribution of some graph invariants over hierarchical product of graphs
- The hierarchical product of graphs
- The generalized hierarchical product of graphs
- Wiener-type invariants of some graph operations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Wiener, eccentric connectivity and Zagreb indices of the hierarchical product of graphs
- Applications of graph operations
Cited In (6)
- Some bounds for topological efficiency of graphs
- General transmission lemma and Wiener complexity of triangular grids
- Global efficiency of graphs
- Local metric dimension of graphs: generalized hierarchical products and some applications
- Topological efficiency of some product graphs
- Eccentric connectivity coindex under graph operations
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)
