Computing Degree Based Topological Indices for Burbankite Network

dc.contributor.authorSajid Naeem
dc.contributor.authorSP23-RMT-028
dc.contributor.authorLHRTP 9589
dc.contributor.authorDr. Imran Zulfqar Cheema
dc.date.accessioned2026-03-13T06:24:40Z
dc.date.issued2024
dc.description.abstractThe use of graph theory to many felds of study has increased signifcantly, especially in the feld of chemical graph theory. Many scholars have been able to explore a range of new directions in the last few years. A chemical graph is a named graph in which the atoms of a compound are represented at the vertices, and the edges represent chemical bonds between atoms. Determining various physical and chemical properties of the molecular structures under study requires an examination of topological indices. Firstly, we focused on degree based topological indices, namely Randic index, atom bond connectivity index, geometric arithmetic index, the frst and the second Zagreb indices and co-indices, the frst and the second multiple Zagreb indices and co-indices, hyper Zagreb index, forgotten in- dex, augmented Zagreb index, Balaban index, redefned Zagreb type indices, of Burbankite Network.
dc.identifier.urihttps://repository.cuilahore.edu.pk/handle/123456789/2797
dc.language.isoen
dc.publisherLibrary Information Services, COMSATS University Islamabad, Lahore Campus
dc.relation.ispartofseriesLHRTP 9589
dc.subjectDr. Imran Zulfqar Cheema
dc.subjectsp23
dc.subjectDepartment of Mathematics
dc.subjectMathematics
dc.titleComputing Degree Based Topological Indices for Burbankite Network
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
9589.pdf
Size:
1.05 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
319 B
Format:
Item-specific license agreed to upon submission
Description:

Collections