Results 31 to 40 of about 418 (70)
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
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 +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
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 +2 more
core +1 more source
Computational and Mathematical BiophysicsAspirin, 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 +1 more
doaj +1 more source
Main Group Metal ChemistryFor 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 +5 more
doaj +1 more source
Identifying codes of corona product graphs [PDF]
, 2013 For a vertex $x$ of a graph $G$, let $N_G[x]$ be the set of $x$ with all of its neighbors in $G$. A set $C$ of vertices is an {\em identifying code} of $G$ if the sets $N_G[x]\cap C$ are nonempty and distinct for all vertices $x$.
Feng, Min, Wang, Kaishun
core
Some new bounds on resolvent energy of a graph
Open MathematicsLet 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 +1 more
doaj +1 more source
Steiner Degree Distance of Two Graph Products
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈SdegG(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj +1 more source
Degree-based topological properties of borophene sheets
Main Group Metal ChemistryThis study examines many innovative topological numbers and establishes mathematical interpretations for boron clusters and borophene coverings. The general Randic index, arithmetic index, and Albertson index are discussed in this work for the alpha ...
Al Khabyah Ali +3 more
doaj +1 more source