Year: 2025
Type: article
Abstract: For a connected graph G with vertex set V (G) and edge set E(G), the first Zagreb eccentricity index and the second Zagreb eccentricity index are defined as, respectively, where e(u) is the eccentricity of vertex u in G.In this paper, we identify the trees that minimize the first and second Zagreb eccentricity indices among all trees with 2n vertices and a perfect matching.
Authors: Jianping Li, Lincong Huang
Institution: Guangdong University of Technology
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7117702191
FWCI:
Cites:
Cited by:
Related to: