scholarly journals Zagreb Polynomials and Redefined Zagreb Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]

2018 ◽  
Author(s):  
Young Chel Kwun ◽  
Abaid ur Rehman Virk ◽  
Waqas Nazeer ◽  
Wei Gao ◽  
Shin Min Kang
Keyword(s):  
Molecular Structure ◽  
Graph Theory ◽  
Molecular Graph ◽  
Zagreb Indices ◽  
Silicon Carbon ◽  
Structure Research

The application of graph theory in chemical and molecular structure research far exceeds people's expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. In this report, we study the silicon-carbon Si2C3-I[p,q] and Si2C3-II[p,q]. We compute several Zagreb polynomials and Redefined Zagreb indices of these silicon-carbons.

scholarly journals On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 320 ◽  
Author(s):  
Young Kwun ◽  
Abaid Virk ◽  
Waqas Nazeer ◽  
M. Rehman ◽  
Shin Kang
Keyword(s):  
Molecular Structure ◽  
Graph Theory ◽  
Molecular Graph ◽  
Chemical Properties ◽  
Topological Indices ◽  
Molecular Compound ◽  
Zagreb Indices ◽  
Silicon Carbon ◽  
Physico Chemical ◽  
Structure Research

The application of graph theory in chemical and molecular structure research has far exceeded people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonds by edges. Topological indices help us to predict many physico-chemical properties of the concerned molecular compound. In this article, we compute Generalized first and multiplicative Zagreb indices, the multiplicative version of the atomic bond connectivity index, and the Generalized multiplicative Geometric Arithmetic index for silicon-carbon Si2C3−I[p,q] and Si2C3−II[p,q] second.

scholarly journals On the Multiplicative Degree-Based Topological Indices of Silicon-Carbon Si2C3-I[p,q] and Si2C3-II[p,q]

2018 ◽  
Author(s):  
Young Chel Kwun ◽  
Abaid ur Rehman Virk ◽  
Waqas Nazeer ◽  
Shin Min Kang
Keyword(s):  
Molecular Structure ◽  
Graph Theory ◽  
Molecular Graph ◽  
Chemical Properties ◽  
Topological Indices ◽  
Molecular Compound ◽  
Silicon Carbon ◽  
Physico Chemical ◽  
Structure Research

The application of graph theory in chemical and molecular structure research far exceeds people's expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. Closed forms of multiplicative degree-based topological indices which are numerical parameters of the structure and determine physico-chemical properties of the concerned molecular compound. In this article, we compute and analyze many multiplicative degree-based topological indices of silicon-carbon Si2C3-I[p,q] and Si2C3-II[p,q].

scholarly journals On Some Properties of Multiplicative Topological Indices in Silicon-Carbon

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Abid Mahboob ◽  
Sajid Mahboob ◽  
Mohammed M. M. Jaradat ◽  
Nigait Nigar ◽  
Imran Siddique
Keyword(s):  
Graph Theory ◽  
Structural Properties ◽  
Topological Index ◽  
Molecular Graph ◽  
Chemical Compounds ◽  
Google Maps ◽  
Chemical Graph ◽  
Zagreb Indices ◽  
Silicon Carbon ◽  
Connectivity Indices

The use of graph theory can be visualized in nanochemistry, computer networks, Google maps, and molecular graph which are common areas to elaborate application of this subject. In nanochemistry, a numeric number (topological index) is used to estimate the biological, physical, and structural properties of chemical compounds that are associated with the chemical graph. In this paper, we compute the first and second multiplicative Zagreb indices ( M 1 G and ( M 1 G )), generalized multiplicative geometric arithmetic index ( GA α II G ), and multiplicative sum connectivity and multiplicative product connectivity indices ( SCII G and PCII G ) of SiC 4 − I m , n and SiC 4 − II m , n .

scholarly journals On multiplicative degree based topological indices for planar octahedron networks

2020 ◽  
Vol 43 (1) ◽  
pp. 219-228
Author(s):  
Ghulam Dustigeer ◽  
Haidar Ali ◽  
Muhammad Imran Khan ◽  
Yu-Ming Chu
Keyword(s):  
Graph Theory ◽  
Information Science ◽  
Biological Activities ◽  
Molecular Graph ◽  
Triangular Prism ◽  
Structure Property ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Chemical Graph Theory ◽  
Analytical Formulas

AbstractChemical graph theory is a branch of graph theory in which a chemical compound is presented with a simple graph called a molecular graph. There are atomic bonds in the chemistry of the chemical atomic graph and edges. The graph is connected when there is at least one connection between its vertices. The number that describes the topology of the graph is called the topological index. Cheminformatics is a new subject which is a combination of chemistry, mathematics and information science. It studies quantitative structure-activity (QSAR) and structure-property (QSPR) relationships that are used to predict the biological activities and properties of chemical compounds. We evaluated the second multiplicative Zagreb index, first and second universal Zagreb indices, first and second hyper Zagreb indices, sum and product connectivity indices for the planar octahedron network, triangular prism network, hex planar octahedron network, and give these indices closed analytical formulas.

Graph Indices

2020 ◽  
pp. 66-91
Author(s):  
V. R. Kulli
Keyword(s):  
Molecular Structure ◽  
Carbon Atom ◽  
Organic Molecule ◽  
Molecular Graph ◽  
Simple Graph ◽  
Chemical Graph ◽  
Zagreb Indices ◽  
Mathematical Properties ◽  
Chemical Graph Theory ◽  
Related Graph

A molecular graph is a finite simple graph representing the carbon-atom skeleton of an organic molecule of a hydrocarbon. Studying molecular graphs is a constant focus in chemical graph theory: an effort to better understand molecular structure. Many types of graph indices such as degree-based graph indices, distance-based graph indices, and counting-related graph indices have been explored recently. Among degree-based graph indices, Zagreb indices are the oldest and studied well. In the last few years, many new graph indices were proposed. The present survey of these graph indices outlines their mathematical properties and also provides an exhaustive bibliography.

scholarly journals Connection-Based Multiplicative Zagreb Indices of Dendrimer Nanostars

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Aqsa Sattar ◽  
Muhammad Javaid ◽  
Ebenezer Bonyah
Keyword(s):  
Graph Theory ◽  
Physicochemical Properties ◽  
Topological Index ◽  
Molecular Graph ◽  
Topological Indices ◽  
Zagreb Indices ◽  
Mathematical Chemistry ◽  
Chemical Structures ◽  
And Mathematics

The field of graph theory is broadly growing and playing a remarkable role in cheminformatics, mainly in chemistry and mathematics in developing different chemical structures and their physicochemical properties. Mathematical chemistry provides a platform to study these physicochemical properties with the help of topological indices (TIs). A topological index (TI) is a function that connects a numeric number to each molecular graph. Zagreb indices (ZIs) are the most studied TIs. In this paper, we establish general expressions to calculate the connection-based multiplicative ZIs, namely, first multiplicative ZIs, second multiplicative ZIs, third multiplicative ZIs, and fourth multiplicative ZIs, of two renowned dendrimer nanostars. The defined expressions just depend on the step of growth of these dendrimers. Moreover, we have compared our calculated for both type of dendrimers with each other.

scholarly journals Computing Topological Indices for Para-Line Graphs of Anthracene

2019 ◽  
Vol 17 (1) ◽  
pp. 955-962 ◽  
Author(s):  
Zhiqiang Zhang ◽  
Zeshan Saleem Mufti ◽  
Muhammad Faisal Nadeem ◽  
Zaheer Ahmad ◽  
Muhammad Kamran Siddiqui ◽  
...  
Keyword(s):  
Graph Theory ◽  
Chemical Compound ◽  
Line Graph ◽  
Molecular Graph ◽  
Chemical Properties ◽  
Molar Refraction ◽  
Chromatographic Behavior ◽  
Chemical Graph ◽  
Chemical Graph Theory ◽  
And Mathematics

AbstractAtoms displayed as vertices and bonds can be shown by edges on a molecular graph. For such graphs we can find the indices showing their bioactivity as well as their physio-chemical properties such as the molar refraction, molar volume, chromatographic behavior, heat of atomization, heat of vaporization, magnetic susceptibility, and the partition coefficient. Today, industry is flourishing because of the interdisciplinary study of different disciplines. This provides a way to understand the application of different disciplines. Chemical graph theory is a mixture of chemistry and mathematics, which plays an important role in chemical graph theory. Chemistry provides a chemical compound, and graph theory transforms this chemical compound into a molecular graphwhich further is studied by different aspects such as topological indices.We will investigate some indices of the line graph of the subdivided graph (para-line graph) of linear-[s] Anthracene and multiple Anthracene.

MUFFIN: multi-scale feature fusion for drug–drug interaction prediction

2021 ◽  
Author(s):  
Yujie Chen ◽  
Tengfei Ma ◽  
Xixi Yang ◽  
Jianmin Wang ◽  
Bosheng Song ◽  
...  
Keyword(s):  
Molecular Structure ◽  
Deep Learning ◽  
Medical Information ◽  
Feature Fusion ◽  
Molecular Graph ◽  
Knowledge Graph ◽  
Sequence Information ◽  
Learning Models ◽  
Scale Feature ◽  
Multi Scale

Abstract Motivation Adverse drug–drug interactions (DDIs) are crucial for drug research and mainly cause morbidity and mortality. Thus, the identification of potential DDIs is essential for doctors, patients and the society. Existing traditional machine learning models rely heavily on handcraft features and lack generalization. Recently, the deep learning approaches that can automatically learn drug features from the molecular graph or drug-related network have improved the ability of computational models to predict unknown DDIs. However, previous works utilized large labeled data and merely considered the structure or sequence information of drugs without considering the relations or topological information between drug and other biomedical objects (e.g. gene, disease and pathway), or considered knowledge graph (KG) without considering the information from the drug molecular structure. Results Accordingly, to effectively explore the joint effect of drug molecular structure and semantic information of drugs in knowledge graph for DDI prediction, we propose a multi-scale feature fusion deep learning model named MUFFIN. MUFFIN can jointly learn the drug representation based on both the drug-self structure information and the KG with rich bio-medical information. In MUFFIN, we designed a bi-level cross strategy that includes cross- and scalar-level components to fuse multi-modal features well. MUFFIN can alleviate the restriction of limited labeled data on deep learning models by crossing the features learned from large-scale KG and drug molecular graph. We evaluated our approach on three datasets and three different tasks including binary-class, multi-class and multi-label DDI prediction tasks. The results showed that MUFFIN outperformed other state-of-the-art baselines. Availability and implementation The source code and data are available at https://github.com/xzenglab/MUFFIN.

scholarly journals Multiplicative Zagreb indices of cacti

2016 ◽  
Vol 08 (03) ◽  
pp. 1650040 ◽  
Author(s):  
Shaohui Wang ◽  
Bing Wei
Keyword(s):  
Graph Theory ◽  
Lower Bounds ◽  
Connected Graph ◽  
Upper And Lower Bounds ◽  
Extremal Graphs ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Material Chemistry ◽  
Cactus Graph ◽  
Cactus Graphs

Let [Formula: see text] be multiplicative Zagreb index of a graph [Formula: see text]. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which is a generalization of trees and has been the interest of researchers in the field of material chemistry and graph theory. In this paper, we use a new tool to obtain the upper and lower bounds of [Formula: see text] for all cactus graphs and characterize the corresponding extremal graphs.

scholarly journals Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 227 ◽  
Author(s):  
Shaohui Wang ◽  
Chunxiang Wang ◽  
Lin Chen ◽  
Jia-Bao Liu ◽  
Zehui Shao
Keyword(s):  
Molecular Graph ◽  
Zagreb Index ◽  
Zagreb Indices

Given a (molecular) graph, the first multiplicative Zagreb index Π 1 is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index Π 2 is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs G n , k having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in G n , k are provided. We also provide these graphs with the largest and smallest Π 1 ( G ) and Π 2 ( G ) in G n , k .

Sign in / Sign up

Export Citation Format

Share Document