Browsing by Author "Mora Giné, Mercè"
Now showing items 21-40 of 97
-
General properties of c-circulant digraphs
Mora Giné, Mercè; Serra Albó, Oriol; Fiol Mora, Miquel Àngel (1988)
Article
Open AccessA digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation ... -
Geometric tree graphs of points in convex position
Hernando Martín, María del Carmen; Hurtado Díaz, Fernando Alfredo; Márquez Pérez, Alberto; Mora Giné, Mercè; Noy Serrano, Marcos (1997)
Article
Open AccessGiven a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and $T_2$ are adjacent ... -
Global location-domination in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2013-12-03)
Research report
Open AccessA dominating set S of a graph G is called locating-dominating, LD-setfor 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 ... -
Graphs attaining the upper bound on the isolation number
Lemanska, Magdalena; Mora Giné, Mercè; Souto Salorio, María josé (Universidad de Cádiz, 2023)
Conference report
Open AccessA set D of vertices of a graph is isolating if the set of vertices not belonging to D or not having a neighbour in D is independent. The isolation number of a graph G, denoted by ¿(G), is the minimum cardinality of an ... -
Graphs with isolation number equal to one third of the order
Lemanska, Magdalena; Mora Giné, Mercè; Souto Salorio, María josé (Elsevier, 2024-05-01)
Article
Restricted access - publisher's policyA 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 , is the minimum cardinality of an isolating set of G. It is ... -
Independent [1,2]-number versus independent domination number
Aleid, Sahar A.; Mora Giné, Mercè; Puertas González, María Luz (2017-01-01)
Article
Open AccessA [1, 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of ... -
Las habilidades sociales del docente universitario: una formación hacia la competencia interpersonal
Gómez Soberón, José Manuel Vicente; Berbegal-Mirabent, Jasmina; Cañabate Carmona, Antonio; Farrerons Vidal, Óscar; Montero Mercadé, Lídia; Mora Giné, Mercè; Santos Boada, Germán; Torre Martínez, María del Rocío de la; Del Corral, Ignacio; Huerta Carrillo, María (2014-07-14)
Article
Open AccessDesde el ICE de la UPC se ha planteado una nueva formación dirigida a todo el profesorado basada en la adquisición de competencias docentes. Uno de los módulos de formación puesto en marcha trabaja la adquisición de la ... -
Las habilidades sociales del docente universitario: una formación hacia la competencia interpersonal
Gómez Soberón, José Manuel Vicente; Berbegal Mirabent, Jasmina; Cañabate Carmona, Antonio; Farrerons Vidal, Óscar; Huerta Carrillo, María; Montero Mercadé, Lídia; Mora Giné, Mercè; Santos Boada, Germán; Torre Martínez, María del Rocío de la; Corral Manuel de Villena, Ignacio de (Congrés Internacional de Docència Universitària i Innovació (CIDUI), 2014)
Conference lecture
Open AccessDesde el ICE de la UPC se ha planteado una nueva formación dirigida a todo el profesorado basada en la adquisición de competencias docentes. Uno de los módulos de formación puesto en marcha trabaja la adquisición de la ... -
Las habilidades sociales del docente universitario: una formación hacia la competencia interpersonal
Gómez Soberón, José Manuel Vicente; Berbegal Mirabent, Jasmina; Farrerons Vidal, Óscar; Cañabate Carmona, Antonio; Huerta Carrillo, María; Montero Mercadé, Lídia; Mora Giné, Mercè; Santos Boada, Germán; Torre Martínez, María del Rocío de la; Corral Manuel de Villena, Ignacio de (Congrés Internacional de Docència Universitària i Innovació (CIDUI), 2014-02-05)
Part of book or chapter of book
Open Access -
LD-graphs and global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
Conference report
Open AccessA dominating setS of a graph G is a locating-dominating-set, 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 ... -
LD-graphs and global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014-09-02)
Article
Restricted access - publisher's policyA dominating set S of a graph G is a locating-dominating-set, 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 ... -
Limited broadcast domination: upper bounds and complexity
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-07-07)
Part of book or chapter of book
Restricted access - publisher's policyEn este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ... -
Locating domination in bipartite graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2018-01-01)
Article
Open AccessA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Locating domination in bipartite graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
Research report
Open AccessA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Locating domination in bipartites graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-07-07)
Part of book or chapter of book
Restricted access - publisher's policyEn este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ... -
Locating domination in graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (Universidad de Sevilla, 2013-10-16)
Part of book or chapter of book
Open AccessA 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 ... -
Locating-dominating codes: Bounds and extremal cardinalities
Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2013-09-01)
Article
Restricted access - publisher's policyIn this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses ... -
Locating-dominating partitions in graphs
Pelayo Melero, Ignacio Manuel; Hernando Martín, María del Carmen; Mora Giné, Mercè (2016)
Conference report
Open AccessLet G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ... -
Location in maximal outerplanar graphs
Claverol Aguas, Mercè; García, Alfredo; Hernández, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel, Javier (2017)
Conference report
Restricted access - publisher's policyIn this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal ... -
MATEMÀTICA DISCRETA
Mora Giné, Mercè (Universitat Politècnica de Catalunya, 2012-03-30)
Exam
Restricted access to the UPC academic community