Maximal Trees for the Inverse Degree Index Under a Maximum Degree Constraint
Match Communications in Mathematical and in Computer Chemistry · 27.04.2026 · 3 (96) · 1069
DOI: 10.46793/match.96-3.21225 ↗Kurz gefasst
Fachartikel in der Zeitschrift Match Communications in Mathematical and in Computer Chemistry, online erschienen am 27.04.2026. Verfasst von Kerman Zyani. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Zyani, K. (2026). Maximal Trees for the Inverse Degree Index Under a Maximum Degree Constraint. Match Communications in Mathematical and in Computer Chemistry, 3(96), 1069. https://doi.org/10.46793/match.96-3.21225
Vancouver
Zyani K. Maximal Trees for the Inverse Degree Index Under a Maximum Degree Constraint. Match Communications in Mathematical and in Computer Chemistry. 2026;3(96):1069. doi:10.46793/match.96-3.21225
BibTeX
@article{Zyani2026,
author = {Zyani, Kerman},
title = {Maximal Trees for the Inverse Degree Index Under a Maximum Degree Constraint},
journal = {Match Communications in Mathematical and in Computer Chemistry},
year = {2026},
volume = {3},
number = {96},
pages = {1069},
doi = {10.46793/match.96-3.21225}
}
EUVIMED