Exploració per autor "Hansberg Pastor, Adriana"
Ara es mostren els items 1-6 de 6
-
Degrees in oriented hypergraphs and Ramsey p-chromatic number
Caro, Y.; Hansberg Pastor, Adriana (2012-08)
Article
Accés restringit per política de l'editorialThe family D(k,m) of graphs having an orientation such that for every vertex v ∈ V (G) either (outdegree) deg+(v) ≤ k or (indegree) deg−(v) ≤ m have been investigated recently in several papers because of the role D(k,m) ... -
Locating-dominating sets and identifying codes in Graphs of Girth at least 5
Balbuena Martínez, Maria Camino Teófila; Foucaud, Florent; Hansberg Pastor, Adriana (2015-04-29)
Article
Accés obertLocating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified ... -
New approach to the k-independence number of a graph
Caro, Yair; Hansberg Pastor, Adriana (2013)
Article
Accés obertLet G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such that the maximum degree in the graph induced by S is at most k. With k(G) we denote the maximum cardinality of a k-independent ... -
On k-domination and j-independence in graphs
Hansberg Pastor, Adriana; Pepper, Ryan (2013-07)
Article
Accés restringit per política de l'editorialLet GG be a graph and let kk and jj be positive integers. A subset DD of the vertex set of GG is a kk-dominating set if every vertex not in DD has at least kk neighbors in DD. The kk-domination numberγk(G)γk(G) is the ... -
Partitions of graphs into small and large sets
Bojilov, Asen; Caro, Yair; Hansberg Pastor, Adriana; Nedyalko, Nevno (2013-09)
Article
Accés restringit per política de l'editorialLet GG be a graph on nn vertices. We call a subset AA of the vertex set V(G)V(G)kk-small if, for every vertex v∈Av∈A, deg(v)≤n−|A|+kdeg(v)≤n−|A|+k. A subset B⊆V(G)B⊆V(G) is called kk-large if, for every vertex u∈Bu∈B, ... -
Reviewing some results on fair domination in graphs
Hansberg Pastor, Adriana (2013-09)
Article
Accés restringit per política de l'editorialA fair dominating set in a graph G is a dominating set S such that all vertices not in S are dominated by the same number of vertices from S; that is, every two vertices outside S have the same number of neighbors in S. ...