Exploració per autor "Mora Giné, Mercè"
Ara es mostren els items 61-80 de 97
-
On computing enclosing isosceles triangles and related problems
(2011-02)
Article
Accés obertGiven a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study a 3-dimensional version of the problem ... -
On geodetic sets formed by boundary vertices
(2003)
Article
Accés obertLet G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types ... -
On global location-domination in bipartite graphs
(2015-06-10)
Report de recerca
Accés obert -
On global location-domination in graphs
(2015-05-29)
Article
Accés obertA dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ... -
On locating and dominating sets in graphs
(2009)
Comunicació de congrés
Accés obert -
On monophonic sets in graphs
(2003)
Report de recerca
Accés obert -
On perfect and quasiperfect domination in graphs
(2014-11-28)
Report de recerca
Accés obert -
On perfect and quasiperfect dominations in graphs
(2014)
Text en actes de congrés
Accés obert -
On perfect and quasiperfect dominations in graphs
(2017-02-27)
Article
Accés obertA subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k -quasiperfect ... -
On the geodetic and the hull numbers in strong product graphs
(2010-12)
Article
Accés restringit per política de l'editorialA set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, every shortest path joining u and v is contained in S. The convex hull CH(S) of a set of vertices S is defined as the smallest convex ... -
On the metric dimension of infinite graphs
(2009-11-04)
Article
Accés restringit per política de l'editorialA set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In ... -
On the metric dimension of infinite graphs
(2012-12-07)
Article
Accés restringit per política de l'editorialA set of vertices Sresolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of a graph G is the minimum cardinality of a resolving set. In this paper ... -
On the metric representation of the vertices of a graph
(2023-09-12)
Article
Accés restringit per política de l'editorialThe metric representation of a vertex u in a connected graph G respect to an ordered vertex subset is the vector of distances . A vertex subset W is a resolving set of G if , for every with . Thus, a resolving set with n ... -
On the Partition Dimension and the Twin Number of a Graph
(2016-03-05)
Report de recerca
Accés obertA partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum ... -
On the Steiner, geodetic and hull numbers of graphs
(2003)
Article
Accés obertGiven a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W) the Steiner interval ... -
Paired and semipaired domination in near-triangulations
(2022-07-22)
Report de recerca
Accés obertA dominating set of a graph G is a subset D of vertices such that every vertex not in D is adjacent to at least one vertex in D. A dominating set D is paired if the subgraph induced by its vertices has a perfect matching, ... -
Parámetros de localización y dominación de un grafo y su complementario
(2012)
Text en actes de congrés
Accés restringit per política de l'editorialDado un grafo G = (V,E), un conjunto S ⊂ V es localiza-dominante si ϕ ̸= N(u)∩S ̸= N(v)∩S ̸= ϕ para todo u, v ∈ V \S. Notamos λ(G) al cardinal m´ınimo de estos conjuntos. En este trabajo estudiamos la relaci´on entre ... -
Perfect and quasiperfect domination in trees
(2016-04-25)
Article
Accés obertA k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k-quasip erfect dominating ... -
Perfect anda quasiperfect domination in trees
(2015-05-29)
Report de recerca
Accés obert -
Quasiperfect domination in trees
(2015-12-18)
Article
Accés obertA k–quasiperfect dominating set ( k=1k=1) of a graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k–quasiperfect dominating ...
