EUVIMEDEUVIMED entdecken
Crossref

Resolving the Conjecture of Tricyclic Graphs Minimizing the Diminished Sombor Index

Kinkar Chandra Das, Rajkumar Harshini, Suresh Elumalai

Match Communications in Mathematical and in Computer Chemistry · 2026 · 95 (3) · 891-900

DOI: 10.46793/match.95-3.16125 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Match Communications in Mathematical and in Computer Chemistry, 2025. Verfasst von Kinkar Chandra Das und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Das, K. C., Harshini, R., & Elumalai, S. (2026). Resolving the Conjecture of Tricyclic Graphs Minimizing the Diminished Sombor Index. Match Communications in Mathematical and in Computer Chemistry, 95(3), 891-900. https://doi.org/10.46793/match.95-3.16125

Vancouver

Das KC, Harshini R, Elumalai S. Resolving the Conjecture of Tricyclic Graphs Minimizing the Diminished Sombor Index. Match Communications in Mathematical and in Computer Chemistry. 2026;95(3):891-900. doi:10.46793/match.95-3.16125

BibTeX
@article{Das2026,
  author = {Das, Kinkar Chandra and Harshini, Rajkumar and Elumalai, Suresh},
  title = {Resolving the Conjecture of Tricyclic Graphs Minimizing the Diminished Sombor Index},
  journal = {Match Communications in Mathematical and in Computer Chemistry},
  year = {2026},
  volume = {95},
  number = {3},
  pages = {891--900},
  doi = {10.46793/match.95-3.16125}
}
Kostenlos starten →