Results 31 to 40 of about 446 (89)

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

The metric dimension and metric independence of a graph [PDF]

, 2001
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core  

Computation of Differential, Integral Operators and Quantitative Structure–Property Analysis of Boron α‐Icosahedral Nanosheet

Journal of Mathematics, Volume 2025, Issue 1, 2025.
In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami, Abdul Rauf Khan, Saad Amin Bhatti, R. Sundareswaran   +3 more
wiley   +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

A comparison of two ontologies of regions [PDF]

, 2000
The ontology of knowledge graphs is compared with the ontology of regions as given by Randell and Cohn.
Botke, M., Hoede, C.
core   +2 more sources

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

Cacti with Extremal PI Index [PDF]

, 2016
The vertex PI index $PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)]$ is a distance-based molecular structure descriptor, where $n_{xy}(x)$ denotes the number of vertices which are closer to the vertex $x$ than to the vertex $y$ and which has been the
Wang, Chunxiang, Wang, Shaohui, Wei, Bing   +2 more
core   +1 more source

Decomposition theorem on matchable distributive lattices

, 2010
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a distributive lattice.
Birkhoff, Cyvin, Cyvin, Felsner, Fournier, Grätzer, Khuller, Klavžar, Klavžar, Lam, Latapy, Lovász, Pretzel, Randić, Randić, Rémila, Rémila, Saldanha, Shiu, Stanley, Wilson, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang   +33 more
core   +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

Some new bounds on resolvent energy of a graph

Open Mathematics
Let GG be a simple graph of order nn with eigenvalues λ1≥λ2≥…≥λn.{\lambda }_{1}\ge {\lambda }_{2}\ge \ldots \ge {\lambda }_{n}. The resolvent energy of GG is a spectrum-based graph invariant defined as ER(G)=∑i=1n(n−λi)−1.{\rm{ER}}(G)={\sum }_{i=1}^{n ...
Altındağ İlkay, Bozkurt Altındağ Şerife Burcu   +1 more
doaj   +1 more source