Results 21 to 30 of about 92 (88)

Topological Invariants for the General Structure of Grape Seed Proanthocyanidins

, 2022
In this paper, we formulate the degree-based topological indicessuch as first Zagreb index, second Zagreb index, third Zagreb index,atom bond connectivity index, geometric-arithmetic (GA) index, generalsum connectivity index, hyper-Zagreb index ...
Muhammad Haroon Aftab; Department of Mathematics and Statistics, The University of Lahore, Lahore, Muhammad Rafaqat; Department of Mathematics and Statistics, The University of Lahore, Lahore, Muhammad Hussain; Department of Mathematics, COMSATS University Islamabad, Lahore campus,   +2 more
core  

Topological Indices of Para-line Graphs of V-Phenylenic Nanostructures

Open Mathematics, 2019
The degree-based topological indices are numerical graph invariants which are used to correlate the physical and chemical properties of a molecule with its structure.
Nadeem Imran, Shaker Hani, Hussain Muhammad, Naseem Asim   +3 more
doaj   +1 more source

Finite-dimensional Zinbiel algebras and combinatorial structures

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022
In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel, Núñez Juan, Tenorio Ángel F.   +2 more
doaj   +1 more source

Laplacian energy and first Zagreb index of Laplacian integral graphs

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022
The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul, Khan Zia Ullah, Tyaglov Mikhail   +2 more
doaj   +1 more source

The Sanskruti index of trees and unicyclic graphs

Open Chemistry, 2019
The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighbors of a ...
Deng Fei, Jiang Huiqin, Liu Jia-Bao, Poklukar Darja Rupnik, Shao Zehui, Wu Pu, Žerovnik Janez   +6 more
doaj   +1 more source

Structural insights into square-heptagonal kinks: a study of degree-based descriptors

Main Group Metal Chemistry
Square-heptagonal kink chains are important polygonal structures in chemical graph theory with relevance to materials science, nanotechnology, and engineering.
Salman Muhammad, Ullah Zafar, Khalid Imran, Fatima Sahar, Shahzaib Syed   +4 more
doaj   +1 more source

Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm

Journal of Intelligent Systems, 2018
Neutrosophy (neutrosophic logic) is used to represent uncertain, indeterminate, and inconsistent information available in the real world. This article proposes a method to provide more sensitivity and precision to indeterminacy, by classifying the ...
Kandasamy Ilanthenral
doaj   +1 more source

Graph-theoretical optimization of the aspirin synthesis pathway: Enhancing green chemistry in pharmaceutical manufacturing

Computational and Mathematical Biophysics
Aspirin, one of the most widely produced and consumed pharmaceuticals globally, presents an ideal case for exploring sustainable synthesis methods in pharmaceutical manufacturing.
Rooban Sanjai Shanmugavel Kannan, Nagarathinam Rangarajan   +1 more
doaj   +1 more source

Study on (r, s)-generalised transformation graphs, a novel perspective based on transformation graphs

Main Group Metal Chemistry
For a graph Q=(V,E){\mathbb{Q}}=\left({\mathbb{V}},{\mathbb{E}}), the transformation graph are defined as graphs with vertex set being V(Q)∪E(Q){\mathbb{V}}\left({\mathbb{Q}})\cup {\mathbb{E}}\left({\mathbb{Q}}) and edge set is described following ...
Ali Parvez, Baby Annmaria, Xavier D. Antony, Theertha Nair A., Ali Haidar, Kirmani Syed Ajaz K.   +5 more
doaj   +1 more source

Comparison between Szeged indices of graphs

, 2020
The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu(e)nv(e) over all edges e = uv of G, where nu(e) is the number of vertices of G lying closer to u than v, and nv(e) is defined analogously. The aim of this paper is to present
Ghalavand, A, Das, Kinkar Chandra, Ashrafi, A.R.   +2 more
core