Topological efficiency under graph operations
DOI10.1007/S12190-016-0997-8zbMATH Open1373.05158OpenAlexW2283846962MaRDI QIDQ1676969
S. Hossein-Zadeh, A. Hamzeh, M. Tavakoli, A. Iranmanesh, A. R. Ashrafi, M. A. Hosseinzadeh
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- The Wiener, eccentric connectivity and Zagreb indices of the hierarchical product of graphs
- Applications of graph operations
Cited In (4)
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)