EUVIMEDEUVIMED entdecken
Open Access · CC0

Extremal c-cyclic graphs with respect to the general multiplicative first Zagreb index

Nasrin Dehgardi, Mahdieh Azari, Yilun Shang

Filomat · 2025 · 39 (32) · 11597-11605

DOI: 10.2298/fil2532597d ↗

Kurz gefasst

Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Nasrin Dehgardi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The general multiplicative first Zagreb index of a simple graph H is expressed as the product of the weights (degH(ω))α over all vertices ω of H, where degH(ω) shows the degree of ω, and α ≠ 0 is a real number. The cyclomatic number of a connected graph H is given by c = ϵ-ν + 1, where ϵ and ν are the size and order of H, respectively. In this paper, we present sharp bounds for the general multiplicative first Zagreb index of simple connected graphs with cyclomatic number c focusing on the cases when c=0, 1, and 2. We also extend our findings to molecular trees and to all simple connected graphs with the maximum degree ∆ and cyclomatic number c, where ∆ ≥ 2c. In addition, we identify the graphs reaching these bounds.

Zitieren

APA

Dehgardi, N., Azari, M., & Shang, Y. (2025). Extremal c-cyclic graphs with respect to the general multiplicative first Zagreb index. Filomat, 39(32), 11597-11605. https://doi.org/10.2298/fil2532597d

Vancouver

Dehgardi N, Azari M, Shang Y. Extremal c-cyclic graphs with respect to the general multiplicative first Zagreb index. Filomat. 2025;39(32):11597-11605. doi:10.2298/fil2532597d

BibTeX
@article{Dehgardi2025,
  author = {Dehgardi, Nasrin and Azari, Mahdieh and Shang, Yilun},
  title = {Extremal c-cyclic graphs with respect to the general multiplicative first Zagreb index},
  journal = {Filomat},
  year = {2025},
  volume = {39},
  number = {32},
  pages = {11597--11605},
  doi = {10.2298/fil2532597d}
}
Kostenlos starten →