Results 21 to 30 of about 915 (122)
On Topological Analysis of Niobium (II) Oxide Network via Curve Fitting and Entropy Measures
Complexity, Volume 2022, Issue 1, 2022., 2022 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
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 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
On the Inverse Problem for Some Topological Indices
Journal of Mathematics, 2021 The study of the inverse problem (IP) based on the topological indices (TIs) deals with the numerical relations to TIs. Mathematically, the IP can be expressed as follows: given a graph parameter/TI that assigns a non-negative integer value g to every ...
Durbar Maji +3 more
doaj +1 more source
[Retracted] On Acyclic Structures with Greatest First Gourava Invariant
Journal of Chemistry, Volume 2022, Issue 1, 2022., 2022 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
Structures devised by the generalizations of two graph operations and their topological descriptors
Main Group Metal Chemistry, 2022 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
Retracted: On the Reformulated Second Zagreb Index of Graph Operations
, 2023 Journal of Chemistry, Volume 2023, Issue 1, 2023.
Journal of Chemistry
wiley +1 more source
[Retracted] On Second Gourava Invariant for q‐Apex Trees
Journal of Chemistry, Volume 2022, Issue 1, 2022., 2022 Let G be a simple connected graph. The second Gourava index of graph G is defined as GO2(G) = ∑θϑ∈E(G)(d(θ) + d(ϑ))d(θ)d(ϑ) where d(θ) denotes the degree of vertex θ. If removal of a vertex of G forms a tree, then G is called an apex tree. Let L ⊂ V(G) with ∣L | = q.
Ying Wang +5 more
wiley +1 more source
On the Reformulated Second Zagreb Index of Graph Operations
Journal of Chemistry, 2021 Topological indices (TIs) are expressed by constant real numbers that reveal the structure of the graphs in QSAR/QSPR investigation. The reformulated second Zagreb index (RSZI) is such a novel TI having good correlations with various physical attributes,
Durbar Maji +2 more
doaj +1 more source
Computing some Laplacian Coefficients of Forests
Journal of Applied Mathematics, Volume 2022, Issue 1, 2022., 2022 Let G be a finite simple graph with Laplacian polynomial ψG,λ=∑k=0n−1n−kckλk. In an earlier paper, the coefficients cn−4 and cn−5 for forests with respect to some degree‐based graph invariants were computed. The aim of this paper is to continue this work by giving an exact formula for the coefficient cn−6.
Ali Ghalavand +2 more
wiley +1 more source
Strings, T-duality breaking, and nonlocality without the shortest distance [PDF]
, 2006 T-duality of string theory suggests nonlocality manifested as the shortest possible distance. As an alternative, we suggest a nonlocal formulation of string theory that breaks T-duality at the fundamental level and does not require the shortest possible ...
A. Giveon +18 more
core +2 more sources