Buscar
Mostrando ítems 1-2 de 2
Resolving Sets Tolerant to Failures in Three-Dimensional Grids
(Springer Nature, 2022)
[Abstract] An ordered set S of vertices of a graph G is a resolving set for G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of ...
Graphs with isolation number equal to one third of the order
(Elsevier B.V., 2024-05)
[Absctract]: A set D of vertices of a graph G is isolating if the set of vertices not in D and with no
neighbor in D is independent. The isolation number of G, denoted by ι(G), is the minimum
cardinality of an isolating ...