View in EDS

Enumeration of spanning trees in a chain of diphenylene graphs.

Saved in:
Bibliographic Details
Title: Enumeration of spanning trees in a chain of diphenylene graphs.
Authors: Modabish, Abdulhafid1 (AUTHOR) hafizmod@yahoo.fr, Husin, Mohamad Nazri2 (AUTHOR) nazri.husin@umt.edu.my, Alameri, Abdu Qaid3 (AUTHOR) a.alameri2222@gmail.com, Ahmed, Hanan4 (AUTHOR) hananahmed1a@gmail.com, Alaeiyan, Mehdi5 (AUTHOR) alaeiyan@iust.ac.ir, Farahani, Mohammed Reza5 (AUTHOR) mrfarahani88@gmail.com, Cancan, Murat6 (AUTHOR) m_cencen@yahoo.com
Source: Journal of Discrete Mathematical Sciences & Cryptography. Feb2022, Vol. 25 Issue 1, p241-251. 11p.
Subjects: Spanning trees, Biphenylene, Planar graphs, Graph theory, Tree graphs, Charts, diagrams, etc., Laplacian matrices
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 τ(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. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Discrete Mathematical Sciences & Cryptography is the property of Taru Publications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
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 τ(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. [ABSTRACT FROM AUTHOR]
ISSN:09720529
DOI:10.1080/09720529.2022.2038931