Results 21 to 30 of about 1,471 (144)
Some More Results on Reciprocal Degree Distance Index and ℱ‐Sum Graphs
A chemical invariant of graphical structure Z is a unique value characteristic that remains unchanged under graph automorphisms. In the study of QSAR/QSPR, like many other chemical invariants, reciprocal degree distance has played a significant role to estimate the bioactivity of several compounds in chemistry.
Asima Razzaque +4 more
wiley +1 more source
Structures devised by the generalizations of two graph operations and their topological descriptors
Graph theory served in different fields of sciences, especially in chemistry in which creating complex structures and studying their enormous properties. Graph operation is a tool to construct complex chemical structures using basic graphs.
Raza Hassan +3 more
doaj +1 more source
Ordering Acyclic Connected Structures of Trees Having Greatest Degree‐Based Invariants
Being building block of data sciences, link prediction plays a vital role in revealing the hidden mechanisms that lead the networking dynamics. Since many techniques depending in vertex similarity and edge features were put forward to rule out many well‐known link prediction challenges, many problems are still there just because of unique formulation ...
S. Kanwal +6 more
wiley +1 more source
On Topological Analysis of Niobium (II) Oxide Network via Curve Fitting and Entropy Measures
The remarkable optical features of metallic nanoparticles have extensively developed the interest of scientists and researchers. The generated heat overwhelms cancer tissue incident to nanoparticles with no damage to sound tissues. Niobium nanoparticles have the ability of easy ligands connection so they are very suitable in treating cancer ...
Muhammad Kamran Siddiqui +6 more
wiley +1 more source
Some New Upper Bounds for the Y‐Index of Graphs
In mathematical chemistry, the topological indices with highly correlation factor play a leading role specifically for developing crucial information in QSPR/QSAR analysis. Recently, there exists a new graph invariant, namely, Y‐index of graph proposed by Alameri as the sum of the fourth power of each and every vertex degree of that graph.
Durbar Maji +3 more
wiley +1 more source
[Retracted] On Acyclic Structures with Greatest First Gourava Invariant
Let ξ be a simple connected graph. The first Gourava index of graph ξ is defined as GO1(ξ) = ∑μη∈E(ξ)[d(μ) + d(η) + d(μ)d(η)], where d(μ) indicates the degree of vertex μ. In this paper, we will find the upper bound of GO1(ξ) for trees of given diameter, order, size, and pendent nodes, by using some graph transformations.
Mariam Imtiaz +5 more
wiley +1 more source
First reformulated Zagreb indices of some classes of graphs
A topological index of a graph is a parameter related to the graph; it does not depend on labeling or pictorial representation of the graph. Graph operations plays a vital role to analyze the structure and properties of a large graph which is derived ...
V. Kaladevi +2 more
doaj +1 more source
Reformulated F-index of graph operations
The first general Zagreb index is defined as $M_1^\lambda(G)=\sum_{v\in V(G)}d_{G}(v)^\lambda$ where $\lambda\in \mathbb{R}-\{0,1\}$. The case $\lambda=3$, is called F-index.
Hamideh Aram, Nasrin Dehgardi
doaj +1 more source
On the indices of certain graph products [PDF]
Molecular descriptors are numerical graph invariants that are used to study the chemical structure of molecules. In this paper, we determine the upper bound of the Sombor index based on four operations involving the subdivision graph, semi-total point ...
Ishita Sarkar, Manjunath Nanjappa
doaj +1 more source
Note on the Reformulated Zagreb Indices of Two Classes of Graphs
The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of its two end vertices minus 2.
Tongkun Qu +3 more
doaj +1 more source

