27 citations · 54 across the 14 of their papers we have counts for
15 papers
On the Edge-Connectivity of the Square of a Graph
Camino Balbuena, Peter Dankelmann
Let be a connected graph. The edge-connectivity of , denoted by , is the minimum number of edges whose removal renders disconnected. Let be the minimum degr…
Identifying codes in line digraphs
C. Balbuena, C. Dalfó, B. Martínez-Barona
Given an integer , a -identifying code in a digraph is a dominating subset of vertices such that all distinct subsets of vertices of cardinality at mos…
Sufficient conditions for a digraph to admit a -identifying code
C. Balbuena, C. Dalfó, B. Martínez-Barona
A -identifying code in a digraph is a subset of vertices of such that all distinct subsets of vertices of cardinality at most have different closed…
Advances on the Conjecture of Erdős-Sós for spiders
Camino Balbuena, Mucuy-Kak Guevara, José R. Portillo +1
- A hamiltonian graph verifying %with a vertex of degree greater or equal than contains any -spider. - If is a graph with average degree $\bar{d} > k…
About -kernels, semikernels and Grundy functions in partial line digraphs
Camino Balbuena, Hortensia Galeana-Sánchez, Mukuy-kak Guevara
Let be a digraph and consider an arc subset and an exhaustive mapping such that the set of heads of is ; the map f…
A Family of Dense Mixed Graphs of Diameter
Gabriela Araujo-Pardo, Camino Balbuena, M. Miller +1
A mixed graph is said to be dense if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We present a c…