REVIEW
Vulnerability Measures and Zagreb Indices of Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Vulnerability Measures and Zagreb Indices of Graphs
read the original abstract
This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and quadrangle-free graphs, yielding formulas for closeness and generalized closeness in such graphs with diameter at most 3. Moreover, using Zagreb indices, we derive bounds for trees and connected graphs with girth at least 7, which are attained by graphs with diameter at most 4. Finally, formulas for closeness and generalized closeness in specific trees are established using Zagreb indices.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.