Results 11 to 20 of about 423,616 (265)
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 +5 more sources
The Simultaneous Strong Metric Dimension of Graph Families
Bulletin of the Malaysian Mathematical Sciences Society, 2015 Let ${\cal G}$ be a family of graphs defined on a common (labeled) vertex set $V$. A set $S\subset V$ is said to be a simultaneous strong metric generator for ${\cal G}$ if it is a strong metric generator for every graph of the family. The minimum cardinality among all simultaneous strong metric generators for ${\cal G}$, denoted by $Sd_s({\cal G ...
Estrada-Moreno, A. +3 more
openaire +4 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
On the fractional strong metric dimension of graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cong X Kang
openaire +4 more sources
Local Fractional Strong Metric Dimension of Certain Rotationally Symmetric Planer Networks
IEEE Access, 2021 Fractional versions of metric based networks invariants widen the scope of application in fields of intelligent systems, computer science and chemistry including, robot navigation, sensor networking, linear optimization problems, scheduling, assignment ...
Faiza Jamil +4 more
doaj +1 more source
The metric dimension of strong product graphs [PDF]
Carpathian Journal of Mathematics, 2015 For an ordered subset S = {s1, s2, . . . sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s1), dG(v, s2), . . . , dG(v, sk)), where dG(x, y) represents the distance between the vertices x and y.
Rodríguez Velázquez, Juan A. +3 more
openaire +4 more sources
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
Contemporary Mathematics and Applications (ConMathA), 2020 The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete ...
Nurma Ariska Sutardji +2 more
doaj +1 more source
Computing strong metric dimension of some special classes of graphs by genetic algorithms [PDF]
Yugoslav Journal of Operations Research, 2008 In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem.
Kratica Jozef +2 more
doaj +1 more source
Strong metric dimension of rooted product graphs [PDF]
International Journal of Computer Mathematics, 2015 16 pages.
Kuziak, Dorota +2 more
openaire +2 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. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S.
Kuziak, Dorota +2 more
openaire +2 more sources