Enumeration of Spanning Trees in a Chain of Diphenylene Graphs
| dc.contributor.author | Modabish, Abdulhafid | |
| dc.contributor.author | Husin, Mohamad Nazri | |
| dc.contributor.author | Alameri, Abdu Qaid | |
| dc.contributor.author | Ahmed, Hanan | |
| dc.contributor.author | Alaeiyan, Mehdi | |
| dc.contributor.author | Farahani, Mohammed Reza | |
| dc.contributor.author | Cancan, Murat | |
| dc.date.accessioned | 2025-05-10T17:37:03Z | |
| dc.date.available | 2025-05-10T17:37:03Z | |
| dc.date.issued | 2022 | |
| dc.description | Alaeiyan, Mehdi/0000-0003-2185-5967; Farahani, Mohammad Reza/0000-0003-2969-4280; Husin, Mohamad Nazri/0000-0003-4196-4984; Alameri, Abdu/0000-0002-9920-4892; Ahmed, Hanan/0000-0002-4008-4873 | en_US |
| dc.description.abstract | Cheminformatics is a modern field of chemistry information science and mathematics that is very much helpful in keeping the data and getting information about chemicals. A new two-dimensional carbon known as diphenylene was identified and synthesized. It is considered one of the materials that have many applications in most fields such as catalysis. The number of spanning trees of a graph G, also known as the complexity of a graph G, denoted by tau(G), is an important, well-studied quantity in graph theory, and appears in a number of applications. In this paper, we introduce a new chemical compound that is a chain of diphenylene where any two diphenylene intersect by one edge. We derive two formulas for the number of spanning trees in a chain of diphenylene planar graphs that have connected intersection of one edge but where the diphenylenes have same sizes. | en_US |
| dc.description.sponsorship | Universiti Malaysia Terengganu [P29000] | en_US |
| dc.description.sponsorship | The authors would like to thanks comittee of 6th International Conference on Combinatorics, Cryptography, Computer Science and Computation and Universiti Malaysia Terengganu for the support of this research work via research vot number: P29000. | en_US |
| dc.identifier.doi | 10.1080/09720529.2022.2038931 | |
| dc.identifier.issn | 0972-0529 | |
| dc.identifier.issn | 2169-0065 | |
| dc.identifier.scopus | 2-s2.0-85128353370 | |
| dc.identifier.uri | https://doi.org/10.1080/09720529.2022.2038931 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14720/14264 | |
| dc.language.iso | en | en_US |
| dc.publisher | Taylor & Francis Ltd | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Spanning Trees | en_US |
| dc.subject | Laplacian Matrix | en_US |
| dc.subject | Diphenylene | en_US |
| dc.subject | Chain Of Diphenylene | en_US |
| dc.title | Enumeration of Spanning Trees in a Chain of Diphenylene Graphs | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | Alaeiyan, Mehdi/0000-0003-2185-5967 | |
| gdc.author.id | Farahani, Mohammad Reza/0000-0003-2969-4280 | |
| gdc.author.id | Husin, Mohamad Nazri/0000-0003-4196-4984 | |
| gdc.author.id | Alameri, Abdu/0000-0002-9920-4892 | |
| gdc.author.id | Ahmed, Hanan/0000-0002-4008-4873 | |
| gdc.author.scopusid | 36680586600 | |
| gdc.author.scopusid | 56925110800 | |
| gdc.author.scopusid | 57194078029 | |
| gdc.author.scopusid | 57222051555 | |
| gdc.author.scopusid | 6507002237 | |
| gdc.author.scopusid | 57190155028 | |
| gdc.author.scopusid | 57190155028 | |
| gdc.author.wosid | Alaeiyan, Mehdi/Hjy-6022-2023 | |
| gdc.author.wosid | Cancan, Murat/Aab-4391-2020 | |
| gdc.author.wosid | Farahani, Mohammad Reza/M-5963-2017 | |
| gdc.author.wosid | Husin, Mohamad Nazri/Aat-1119-2020 | |
| gdc.author.wosid | Alameri, Abdu/Aae-5562-2022 | |
| gdc.author.wosid | Ahmed, Hanan/Aak-9278-2021 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.description.department | T.C. Van Yüzüncü Yıl Üniversitesi | en_US |
| gdc.description.departmenttemp | [Modabish, Abdulhafid] Sanaa Univ, Fac Sci, Dept Math, Sanaa, Yemen; [Husin, Mohamad Nazri] Univ Malaysia Terengganu, Fac Ocean Engn Technol & Informat, Special Interest Grp Modelling & Data Analyt SIGM, Terengganu 21030, Malaysia; [Alameri, Abdu Qaid] Univ Sci & Technol, Dept Biomed Engn, Sanaa, Yemen; [Ahmed, Hanan] Univ Mysore, Yuvarajas Coll, Dept Math, Mysore 570005, Karnataka, India; [Alaeiyan, Mehdi; Farahani, Mohammed Reza] Iran Univ Sci & Technol, Dept Math, Narmak, Iran; [Cancan, Murat] Van Yuzuncu Yil Univ, Fac Educ, TR-65090 Van, Turkey | en_US |
| gdc.description.endpage | 251 | en_US |
| gdc.description.issue | 1 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q2 | |
| gdc.description.startpage | 241 | en_US |
| gdc.description.volume | 25 | en_US |
| gdc.description.woscitationindex | Emerging Sources Citation Index | |
| gdc.description.wosquality | N/A | |
| gdc.identifier.wos | WOS:000780493100020 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus |