Some bounds for topological efficiency of graphs

zbMATH Open1427.05067MaRDI QIDQ5206601FDOQ5206601

Authors: S. Hossein-Zadeh, M. A. Hosseinzadeh, A. Hamzeh, A. Iranmanesh 

Publication date: 18 December 2019

Recommendations

• Topological efficiency under graph operations
• Topological efficiency of some product graphs
• On some bounds and exact formulae for connective eccentric indices of graphs under some graph operations
• Computing the eccentric-distance sum for graph operations
• Computing some topological indices of rooted product of graphs

zbMATH Keywords

Wiener indexeccentric connectivity indexgraph producttopological efficiency index

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) Combinatorial inequalities (05A20)

Cited In (2)

• Topological efficiency under graph operations
• Topological efficiency of some product graphs

This page was built for publication: Some bounds for topological efficiency of graphs

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