Sharp lower bounds on the Narumi-Katayama index of graph operations

DOI10.1016/j.amc.2014.04.088zbMath1334.05129OpenAlexW2072626441MaRDI QIDQ274395

Mahdieh Azari

Publication date: 22 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.04.088

zbMATH Keywords

degreelower boundgraph operationsNarumi-Katayama index

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (25)

F-Index of some graph operations ⋮ Vertex-weighted Wiener polynomials of subdivision-related graphs ⋮ Generalized four new sums of graphs and their Zagreb indices ⋮ Unnamed Item ⋮ Generalized Zagreb index of product graphs ⋮ Further results on non-self-centrality measures of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reformulated first Zagreb index of some graph operations ⋮ The first general Zagreb coindex of graph operations ⋮ The vertex Zagreb indices of some graph operations ⋮ Narumi–Katayama index of total transformation graphs ⋮ Unnamed Item ⋮ Bounds for neighborhood Zagreb index and its explicit expressions under some graph operations ⋮ On the reformulated multiplicative first Zagreb index of trees and unicyclic graphs ⋮ Sharp bounds on the inverse sum indeg index ⋮ Splices, Links, and their Edge-Degree Distances ⋮ COMPARING THE SECOND MULTIPLICATIVE ZAGREB COINDEX WITH SOME GRAPH INVARIANTS ⋮ Splice Graphs and their Vertex-Degree-Based Invariants ⋮ A note on vertex-edge Wiener indices of graphs ⋮ A note on hyper-Zagreb index of graph operations ⋮ Eccentric connectivity coindex under graph operations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• Some properties of the Narumi-Katayama index
• A history of graph entropy measures
• On the Zagreb indices of the line graphs of the subdivision graphs
• Distribution of some graph invariants over hierarchical product of graphs
• Information processing in complex networks: Graph entropy and information functionals
• The first and second Zagreb indices of some graph operations
• On the sum of all distances in composite graphs
• Computing the eccentric-distance sum for graph operations
• On structure-sensitivity of degree-based topological indices
• The multiplicative Zagreb indices of graph operations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sharp lower bounds on the Narumi-Katayama index of graph operations