Results 11 to 20 of about 772,522 (267)
The dominant strong metric dimension of graphs
AKCE International Journal of Graphs and CombinatoricsGraphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication ...
M. Valiyanpour +2 more
doaj +3 more sources
On the strong metric dimension of the strong products of graphs
Open Mathematics, 2015 Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u.
Kuziak Dorota +2 more
doaj +4 more sources
On the strong metric dimension of composed graphs [PDF]
arXiv.org, 2022 Two vertices $u$ and $v$ of an undirected graph $G$ are strongly resolved by a vertex $w$ if there is a shortest path between $w$ and $u$ containing $v$ or a shortest path between $w$ and $v$ containing $u$. A vertex set $R$ is a strong resolving set for
M. Wagner, Yannick Schmitz, Egon Wanke
semanticscholar +3 more sources
The Simultaneous Strong Metric Dimension of Graph Families [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2015 Let $$\mathcal{G}$$G be a family of graphs defined on a common (labelled) vertex set V. A set $$S\subset V$$S⊂V is said to be a simultaneous strong metric generator for $$\mathcal{G}$$G if it is a strong metric generator for every graph of the family ...
Y. Ramírez-Cruz
semanticscholar +3 more sources
On the Strong Metric Dimension of Cartesian Sum Graphs [PDF]
Fundamenta Informaticae, 2015 A vertex w of a connected graph G strongly resolves two vertices u, v ∈ V (G), if there exists some shortest u – w path containing v or some shortest v – w path containing u.
D. Kuziak +2 more
semanticscholar +4 more sources
Erratum to “On the strong metric dimension of the strong products of graphs”
Open Mathematics, 2015 The original version of the article was published in Open Mathematics (formerly Central European Journal of Mathematics) 13 (2015) 64–74. Unfortunately, the original version of this article contains a mistake: in Lemma 2.17 appears that for any C1-graph ...
Kuziak Dorota +2 more
doaj +3 more sources
Morphological Composition Influences Redundancy, Complementarity and Ecological Relevance of Habitat Complexity Metrics in Simulated Coral Communities [PDF]
Ecology and EvolutionEarth's most complex and biodiverse ecosystems are characterised by high habitat complexity. On coral reefs, habitat complexity is influenced by the diverse morphology and composition of hard corals, shaping reef structure and shelter provision for many ...
Daphne Oh +3 more
doaj +2 more sources
Leveraging Large Language Models to Evaluate the Quality of Narrative Feedback for Surgery Residents in Competency-Based Medical Education [PDF]
Annals of Surgery OpenObjective:. This study aimed to investigate large language model (LLM) performance in evaluating narrative feedback quality in the entrustable professional activities (EPAs) assessments within a Surgical Foundations program. Background:. Transitioning to
Benjamin Y.M. Kwan, MD +6 more
doaj +2 more sources
Computing the strong metric dimension for co-maximal ideal graphs of commutative rings [PDF]
Journal of Algebra and its Applications, 2022 Let [Formula: see text] be a commutative ring with identity. The co-maximal ideal graph of [Formula: see text], denoted by [Formula: see text], is a simple graph whose vertices are proper ideals of [Formula: see text] which are not contained in the ...
R. Shahriyari +3 more
semanticscholar +1 more source
The Local Metric Dimension of Strong Product Graphs [PDF]
Graphs and Combinatorics, 2015 A vertex $v\in V(G)$ is said to distinguish two vertices $x,y\in V(G)$ of a nontrivial connected graph $G$ if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\subset V(G)$ is a local metric generator for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex of $S$.
Barragán-Ramírez, Gabriel A. +1 more
openaire +3 more sources