Now showing items 1-20 of 88

• #### Antimagic labelings of caterpillars ﻿

(2019-04-15)
Article
Open Access
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to edges incident ...
• #### Apunts de Matemàtica Discreta ﻿

(Universitat Politècnica de Catalunya, 2012)
Lecture notes
Open Access
• #### Boundary-type sets and product operators in graphs ﻿

(2010)
Conference lecture
Open Access
• #### Caterpillars are antimagic ﻿

(2021-01-21)
Article
Open Access
An antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to the ...
• #### Coloración de grafos por vecindades diferentes. ﻿

(2017-07-07)
Part of book or chapter of book
Restricted access - publisher's policy
En 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 ...
• #### Completion and decomposition of hypergraphs into dominating sets of graphs ﻿

(2015-11)
Article
Open Access
The collection of the vertex dominating sets of a graph defines a hypergraph on the set of vertices of the graph. However, there are hypergraphs H that are not the collection of the vertex dominating sets of any graph. ...
• #### Distance 2-domination in prisms of graphs ﻿

(2017-01-01)
Article
Open Access
A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ¿ ( V ( G ) - D ) and D is at most two. Let ¿ 2 ( G ) denote the size of a smallest distance 2 -dominating set of ...
• #### Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs ﻿

(2017-10-16)
Research report
Open Access
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
• #### Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs ﻿

(2018-04-20)
Article
Open Access
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
• #### Elaboració d’un pla de tutories per a la FIB ﻿

(Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2013-02-08)
Conference report / Conference lecture
Open Access
La majoria d'estudiants que accedeixen a la universitat, i en concret a la FIB, no són conscients del que comporta cursar una carrera universitària. Els estudis universitaris requereixen molta dedicació. Sovint els ...
• #### Elimination properties for minimal dominating sets of graphs ﻿

(2020-01-01)
Article
Open Access
A dominating set of a graph is a vertex subset such that every vertexnot in the subset is adjacent to at least one in the subset. In this paper westudy whenever there exists a new dominating set contained (respectively, ...
• #### Extremal graph theory for metric dimension and diameter ﻿

(2010-02-22)
Article
Open Access
A 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 G is the minimum cardinality of a resolving set of G. Let ...
• #### Extremal graph theory for metric dimension and diameter ﻿

(2010)
Article
Open Access
• #### Fitting a two-joint orthogonal chain to a point set ﻿

(2011-04)
Article
Open Access
We study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n points in the plane, where the objective function is to minimize the maximum orthogonal distance from S to the chain. We show that this ...
• #### Fonaments de la matemàtica. Resums, exercicis i problemes ﻿

(Universitat Politècnica de Catalunya, 2014)
Problem statement, exercise
Open Access
• #### General bounds on limited broadcast domination ﻿

(2016-09-19)
Research report
Open Access
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ...
• #### General bounds on limited broadcast domination ﻿

(Chapman & Hall/CRC, 2018-10-26)
Article
Open Access
Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and ...
• #### General properties of c-circulant digraphs ﻿

(1988)
Article
Open Access
A 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 ﻿

(1997)
Article
Open Access
Given 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 ﻿

(2013-12-03)
Research report
Open Access
A 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 ...