Results 61 to 70 of about 8,016,307 (335)
On resolving efficient domination number of comb product of special graphs
, 2021 Let G be a connected, finite, and undirected graph. A vertex set D in G is an efficient dominating set of G if D is an independent set and for each point υ ∈ V(G)-D is adjacent to precisely one vertex d ∈ D.
R. A. Hakim +4 more
semanticscholar +1 more source
Resolving Restrained Domination in Graphs
European Journal of Pure and Applied Mathematics, 2021 Let G be a connected graph. Brigham et al. [3] defined a resolving dominating setas a set S of vertices of a connected graph G that is both resolving and dominating.
Gerald B. Monsanto, Helen M. Rara
semanticscholar +1 more source
A contemporary postulates on resolvable sets and functions
Neutrosophic Sets and Systems, 2023 In this article, a new class of sets namely neutrosophic resolvable sets in neutrosophic topological space have been introduced. We present the neutrosophic resolvable functions between neutrosophic topological spaces by neutrosophic resolvables sets.
M. Deepa, D. Sasikala, Said Broumi
openaire +2 more sources
Bounds for metric dimensions of generalized neighborhood corona graphs
Heliyon, 2021 In this paper, the authors analysed metric dimensions of arbitrary graphs G★˜∧i=1|V(G)|Hi in which graphs G,H1,H2,…,H|V(G)| are non-trivial, G is connected, and ★˜ denotes generalized neighborhood corona operation.
Rinurwati, S.E. Setiawan, Slamin
doaj +1 more source
The Resolving Graph of Amalgamation of Cycles [PDF]
, 2010 For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1),d(v,w_2),...,d(v,w_k)) where d(x,y) represents the distance between the ...
Baskoro, Edy Tri +3 more
core
Resolving Transition Metal Chemical Space: Feature Selection for Machine Learning and Structure-Property Relationships. [PDF]
Journal of Physical Chemistry A, 2017 Machine learning (ML) of quantum mechanical properties shows promise for accelerating chemical discovery. For transition metal chemistry where accurate calculations are computationally costly and available training data sets are small, the molecular ...
J. Janet, Heather J. Kulik
semanticscholar +1 more source
Browder S-Resolvent Equation in Quaternionic Setting
Complex Analysis and Operator TheoryThis paper is devoted to the study of the S-eigenvalue of finite type of a bounded right quaternionic linear operator acting in a right quaternionic Hilbert space. The study is based on the different properties of the Riesz projection associated with the connected part of the S-spectrum.
Baloudi, Hatem +2 more
openaire +2 more sources
Exploring lipid diversity and minimalism to define membrane requirements for synthetic cells
FEBS Letters, EarlyView.Designing the lipid membrane of synthetic cells is a complex task, in which its various roles (among them solute transport, membrane protein support, and self‐replication) should all be integrated. In this review, we report the latest top‐down and bottom‐up advances and discuss compatibility and complexity issues of current engineering approaches ...
Sergiy Gan +2 more
wiley +1 more source
The connected partition dimension of truncated wheels
AKCE International Journal of Graphs and Combinatorics, 2021 Let G be a connected graph. For a vertex v of G and a subset S of V(G), the distance between v and S is d(v, S) = min Given an ordered k-partition = of V(G), the representation of v with respect to is the k-vector If for each pair of distinct vertices ...
Lyndon L. Lazaro, Jose B. Rosario
doaj +1 more source
Characterization of Randomly k-Dimensional Graphs [PDF]
, 2011 For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),.,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y)$ is the ...
Jannesari, Mohsen, Omoomi, Behnaz
core