Logo

Download

Title:
M-Polynomials and Zagreb Indices for i-Iterated Subdivided-Line Graphs
Authors:
Vitor S. Ponciano ORCID iD 0000-0002-7391-620X
Diego Pacheco ORCID iD 0000-0001-7118-1329
Simone Dantas ORCID iD 0000-0002-8340-4881
Alessandra B. Verissimo ORCID iD 0000-0002-2177-9223
Volume
95
Issue
1
Year
2026
Pages
95-110
Abstract

The \( i \)-iterated subdivided-line graph \( \Gamma^i(G) \) of a base graph \( G \) is the graph obtained from \( G \) by iteratively applying the subdivided-line graph operation \( i \) times. % The M-polynomial of a graph \( G \) is a bivariate polynomial that encodes the degree-based properties of \( G \). In this paper, we present a general formula expressing the M-polynomial of \( \Gamma^i(G) \) in terms of the degrees of the vertices of the base graph \( G \). % We compute the First and Second Zagreb indices from the M-polynomial of \( i \)-iterated subdivided-line graphs \( \Gamma^i(G) \) when \( G \) belongs to several graph classes, such as wheel, ladder, \( \Delta \)-regular, cycle, and tadpole graphs. The obtained results generalize those of Ranjini et al. (2011). Additionally, we analyse the impact of the vertex of maximum degree on the value of the First and Second Zagreb indices, providing asymptotic upper bounds for \( i \)-iterated subdivided-line graphs of general graphs.