B. Llano

activity

20082018

most citedAn inequality for Kruskal-Macaulay functions

1 citations · 4 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2018

Bounds on the cardinality of restricted sumsets in $Z_{p}$

Gabriel Bengochea, Bernardo Llano

In this paper we present a procedure which allows to transform a subset $A$ of $Z_{p}$ into a set $A^{'}$ such that $ |2\hspace{0.15cm}\widehat{} A'|\leq|2\hspace{0.15cm}\wi…

math.CO2016

The number of dominating $k$ -sets of paths, cycles and wheels

Jorge L. Arocha, Bernardo Llano

We give a shorter proof of the recurrence relation for the domination polynomial $γ (P_{n}, t)$ and for the number $γ_{k} (P_{n})$ of dominating $k$ -sets of the path with $n$ vertices…

math.CO2015★ 1 cited

Two characterizations of simple circulant tournaments

Bernardo Llano

The \textit{acyclic disconnection} $ω (D)$ (resp. the \textit{directed triangle free disconnection } $ω_{3} (D)$ ) of a digraph $D$ is defined as the…

math.CO2012★ 1 cited

$k$ -colored kernels in semicomplete multipartite digraphs

Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros

An $m$ -colored digraph $D$ has $k$ -colored kernel if there exists a subset $K$ of its vertices such that for every vertex $v \in / K$ there exists an at most $k$ -colored directed…

math.CO2012★ 1 cited

k-colored kernels

Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros

We study $k$ -colored kernels in $m$ -colored digraphs. An $m$ -colored digraph $D$ has $k$ -colored kernel if there exists a subset $K$ of its vertices such that (i) from every vertex…

math.CO2008★ 1 cited

An inequality for Kruskal-Macaulay functions

Bernardo M. Ábrego, Silvia Fernández-Merchant, Bernardo Llano

Given integers $k \geq 1$ and $n \geq 0$ , there is a unique way of writing $n$ as $n = (k n _{k}) + (k - 1 n _{k - 1}) + ... + (1 n _{1})$ so that $0 \leq n_{1} < ... < n_{k - 1} < n_{k}$ …