Results 21 to 30 of about 150,008 (260)

DETERMINING THE DOMINANT METRIC DIMENSION FOR VARIOUS GRAPHS [PDF]

Journal of Mechanics of Continua and Mathematical Sciences
In this paper, we examine the dominating metric dimension of various graph types. A resolving set is a subset of vertices that uniquely identifies each vertex in the graph based on its distances to others, and the metric dimension is the minimum size of
Iqbal M. Batiha, Iqbal H. Jebril, Basma Mohamed   +2 more
doaj   +1 more source

Resolving-power dominating sets

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sudeep Stephen, Bharati Rajan, Cyriac Grigorious, Albert William   +3 more
openaire   +3 more sources

Levenshtein graphs: Resolvability, automorphisms & determining sets

Discrete Mathematics, 2023
22 pages, 3 ...
Perrin E. Ruth, Manuel E. Lladser
openaire   +3 more sources

Resolving Independent Dominating Set pada Graf Bunga, Graf Gear, dan Graf Bunga Matahari

Contemporary Mathematics and Applications (ConMathA), 2023
Resolving independent dominating set is the development of metric dimension and independent dominating set. Resolving independent dominating sets is a concept which discusses about determining the minimum vertex on a graph provided that the vertex that ...
Rafiantika Megahniah Prihandini, Nabilah Ayu Az-Zahra, Dafik, Antonius Cahya Prihandoko, Robiatul Adawiyah   +4 more
doaj   +1 more source

Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure.

PLoS ONE, 2023
The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin, Khurram Shahzad, Abdul Rauf, Fairouz Tchier, Adnan Aslam   +4 more
doaj   +1 more source

Notes on the resolvent set

Kyoto Journal of Mathematics, 1986
We want to add here another two proofs that the resolvent set of a linear operator is open. The first proof depends on the Hahn-Banach theorem and the second on the Neumann series construction of a linear isomorphism between Ran(A-\(\lambda)\) and Ran(A-\(\mu)\).
Ikebe, Teruo, Yoshioka, Takashi
openaire   +3 more sources

Resolving sets for Johnson and Kneser graphs

European Journal of Combinatorics, 2013
A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions,
Robert F. Bailey, José Cáceres, Delia Garijo, Antonio González Herrera, Alberto Márquez 0001, Karen Meagher, María Luz Puertas   +6 more
openaire   +4 more sources

Coloring Cantor sets and resolvability of pseudocompact spaces [PDF]

Commentationes Mathematicae Universitatis Carolinae, 2019
8 ...
Juhász, István, Soukup, Lajos, Szentmiklóssy, Zoltán   +2 more
openaire   +3 more sources

A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon

, 2022
Personal reasons, Professor Jia Bao Liu asked us not to mention his name in the article and to thank him only in the acknowledgments ...
Zafari, Ali, Alikhani, Saeid
openaire   +2 more sources

Fault-Tolerant Resolvability and Extremal Structures of Graphs

Mathematics, 2019
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric dimension n, n − 1 , and 2, which are the lower and upper extremal cases.
Hassan Raza, Sakander Hayat, Muhammad Imran, Xiang-Feng Pan   +3 more
doaj   +1 more source