Results 21 to 30 of about 394,923 (245)
Dominant Mixed Metric Dimension of Graph
For $k-$ordered set $W=\{s_1, s_2,\dots, s_k \}$ of vertex set $G$, the representation of a vertex or edge $a$ of $G$ with respect to $W$ is $r(a|W)=(d(a,s_1), d(a,s_2),\dots, d(a,s_k))$ where $a$ is vertex so that $d(a,s_i)$ is a distance between of the
R. Alfarisi +3 more
semanticscholar +2 more sources
The fractal dimension of resting state EEG increases over age in children. [PDF]
Resting-state electroencephalography (rs-EEG) represents spontaneous neural activity and is increasingly analyzed using nonlinear measures to assess brain complexity. The Higuchi Fractal Dimension (HFD) is a widely used metric for quantifying the fractal
Tou SLJ, Chau T.
europepmc +2 more sources
The Mixed Partition Dimension: A New Resolvability Parameter in Graph Theory
In this article, we introduce a novel graph-theoretical parameter called the mixed partition dimension and apply it to the path graph and the hexagonal network.
Siti Norziahidayu Amzee Zamri +4 more
doaj +2 more sources
Study on mixed metric dimension of STAR and its Comb product with path
Darmaji, N. Azahra, R. Alfarisi
semanticscholar +2 more sources
The comparative study of resolving parameters for a family of ladder networks
For a simple connected graph $ G = (V, E) $, a vertex $ x\in V $ distinguishes two elements (vertices or edges) $ x_1\in V, y_1 \in E $ if $ d(x, x_1)\neq d(x, y_1). $ A subset $ Q_m\subset V $ is a mixed metric generator for $ G, $ if every two distinct
Mohra Zayed +3 more
doaj +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source
Generalized perimantanes diamondoid structure and their edge-based metric dimensions
Due to its superlative physical qualities and its beauty, the diamond is a renowned structure. While the green-colored perimantanes diamondoid is one of a higher diamond structure.
Al-Nashri Al-Hossain Ahmad, Ali Ahmad
doaj +1 more source
Frequency-aware Dimension Selection for Static Word Embedding by Mixed Product Distance [PDF]
Static word embedding is still useful, particularly for context-unavailable tasks, because in the case of no context available, pre-trained language models often perform worse than static word embeddings.
Lingfeng Shen +3 more
semanticscholar +1 more source
Gravitational dressing of D-instantons [PDF]
The non-perturbative corrections to the universal hypermultiplet moduli space metric in the type-IIA superstring compactification on a Calabi-Yau threefold are investigated in the presence of 4d, N=2 supergravity.
Atiyah +31 more
core +4 more sources

