EUVIMEDEUVIMED entdecken
Crossref

Ordering chemical graphs by Sombor indices and its applications

Hechao Liu, Lihua You, Yufei Huang

match Communications in Mathematical and in Computer Chemistry · 2022

DOI: 10.46793/match.87-1.005l ↗

Kurz gefasst

Fachartikel in der Zeitschrift match Communications in Mathematical and in Computer Chemistry, 2022. Verfasst von Hechao Liu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 48-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Topological indices are a class of numerical invariants that predict certain physical and chemical properties of molecules. Recently, two novel topological indices, named as Sombor index and reduced Sombor index, were introduced by Gutman, defined as where denotes the degree of vertex in . In this paper, our aim is to order the chemical trees, chemical unicyclic graphs, chemical bicyclic graphs and chemical tricyclic graphs with respect to Sombor index and reduced Sombor index. We determine the first fourteen minimum chemical trees, the first four minimum chemical unicyclic graphs, the first three minimum chemical bicyclic graphs, the first seven minimum chemical tricyclic graphs. At last, we consider the applications of reduced Sombor index to octane isomers.

Zitieren

APA

Liu, H., You, L., & Huang, Y. (2022). Ordering chemical graphs by Sombor indices and its applications. match Communications in Mathematical and in Computer Chemistry. https://doi.org/10.46793/match.87-1.005l

Vancouver

Liu H, You L, Huang Y. Ordering chemical graphs by Sombor indices and its applications. match Communications in Mathematical and in Computer Chemistry. 2022. doi:10.46793/match.87-1.005l

BibTeX
@article{Liu2022,
  author = {Liu, Hechao and You, Lihua and Huang, Yufei},
  title = {Ordering chemical graphs by Sombor indices and its applications},
  journal = {match Communications in Mathematical and in Computer Chemistry},
  year = {2022},
  doi = {10.46793/match.87-1.005l}
}
Kostenlos starten →