Eccentric adjacency index of graphs with a given number of cut edges

DOI10.1007/s40840-019-00820-xzbMath1437.05050OpenAlexW2965525415WikidataQ127411618 ScholiaQ127411618MaRDI QIDQ1988564

Shehnaz Akhter, Rashid Farooq

Publication date: 23 April 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00820-x

zbMATH Keywords

cut edgeextremal valueseccentric adjacency index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (7)

On the graph connectivity and the variable sum exdeg index ⋮ On the \(A_\sigma\)-spectral radii of graphs with some given parameters ⋮ On the eccentric distance sum of trees with given maximum degree ⋮ Unnamed Item ⋮ On variable sum exdeg indices of quasi-tree graphs and unicyclic graphs ⋮ General degree-eccentricity index of trees ⋮ Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further results on the eccentric distance sum
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• On the monotonicity of topological indices and the connectivity of a graph
• Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
• On the spectral radius of graphs with cut edges
• Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter
• Extremal Zagreb indices of graphs with a given number of cut edges
• On the Estrada index of graphs with given number of cut edges
• The eccentric adjacency index of unicyclic graphs and trees

This page was built for publication: Eccentric adjacency index of graphs with a given number of cut edges