Camino Balbuena

ORCID

Publication Activity (10 Years)

Years Active: 1996-2021
Publications (10 Years): 22

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Discret. Math.

Electron. J. Comb.

Publications

Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona
-identifying code. Discuss. Math. Graph Theory 41 (4) (2021)
Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona
Identifying codes in line digraphs. Appl. Math. Comput. 383 (2020)
Encarnación Abajo, Camino Balbuena, Manuel Bendala, Xavier Marcote
Improving bounds on the order of regular graphs of girth 5. Discret. Math. 342 (10) (2019)
Camino Balbuena, Xavier Marcote
-restricted edge-connectivity of Kneser graphs. Appl. Math. Comput. 343 (2019)
Camino Balbuena, Hortensia Galeana-Sánchez, Mucuy-kak Guevara
-kernels, semikernels and Grundy functions in partial line digraphs. Discuss. Math. Graph Theory 39 (4) (2019)
Camino Balbuena, Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen
Rainbow connectivity of Moore cages of girth 6. Discret. Appl. Math. 250 (2018)
Camino Balbuena, Diego González-Moreno, Mika Olsen
-restricted arc connectivity of some bipartite tournaments. Appl. Math. Comput. 331 (2018)
Camino Balbuena, Diego González-Moreno, Mika Olsen
Vertex disjoint 4-cycles in bipartite tournaments. Discret. Math. 341 (4) (2018)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate
An alternate description of a (q + 1, 8)-cage. Art Discret. Appl. Math. 1 (2) (2018)
Encarnación Abajo, Camino Balbuena, Manuel Bendala
Elliptic semiplanes and regular graphs with girth 5. Electron. Notes Discret. Math. 68 (2018)
Gabriela Araujo-Pardo, Camino Balbuena, Mirka Miller, Mária Zdímalová
A family of mixed graphs with large order and diameter 2. Discret. Appl. Math. 218 (2017)
Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala
New small regular graphs of girth 5. Discret. Math. 340 (8) (2017)
C. Araujo-Pardo, Camino Balbuena, Mirka Miller, Mária Zdímalová
A construction of dense mixed graphs of diameter 2. Electron. Notes Discret. Math. 54 (2016)
Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala
New family of small regular graphs of girth 5. Electron. Notes Discret. Math. 54 (2016)
Mucuy-kak Guevara, Camino Balbuena, Hortensia Galeana-Sánchez
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs. Electron. Notes Discret. Math. 54 (2016)
Diego González-Moreno, Camino Balbuena, Mika Olsen
Vertex-disjoint cycles in bipartite tournaments. Electron. Notes Discret. Math. 54 (2016)
Camino Balbuena, Florent Foucaud, Adriana Hansberg
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. Electron. J. Comb. 22 (2) (2015)
Camino Balbuena, Julián Salas
On a conjecture on the order of cages with a given girth pair. Discret. Appl. Math. (2015)
Camino Balbuena, Mika Olsen
On the acyclic disconnection and the girth. Discret. Appl. Math. 186 (2015)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate
A Construction of Small (q-1)-Regular Graphs of Girth 8. Electron. J. Comb. 22 (2) (2015)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Julián Salas
Small Regular Graphs of Girth 7. Electron. J. Comb. 22 (3) (2015)
Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. Graphs Comb. 31 (5) (2015)
Camino Balbuena, Florent Foucaud, Adriana Hansberg
Locating-dominating sets and identifying codes in graphs of girth at least 5. CoRR (2014)
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano
On the connectivity and restricted edge-connectivity of 3-arc graphs. Discret. Appl. Math. 162 (2014)
Camino Balbuena, Julián Salas
On the order of graphs with a given girth pair. Discret. Math. 321 (2014)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Julián Salas
Families of small regular graphs of girth 7. Electron. Notes Discret. Math. 40 (2013)
Hongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote
On Superconnectivity of (4, g)-Cages. Graphs Comb. 29 (1) (2013)
Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros
)-cages. Discret. Appl. Math. 161 (6) (2013)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Gloria López-Chávez
Constructions of biregular cages of girth five. Electron. Notes Discret. Math. 40 (2013)
Camino Balbuena, Xavier Marcote
The k-restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 161 (1-2) (2013)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Gloria López-Chávez
Biregular Cages of Girth Five. Electron. J. Comb. 20 (1) (2013)
Gloria López-Chávez, Gabriela Araujo-Pardo, Luis Montejano, Camino Balbuena
Bounds on the order of biregular graphs with even girth at least 8. Electron. Notes Discret. Math. 40 (2013)
Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano
-geodetic digraphs. Networks 61 (1) (2013)
Camino Balbuena, Mirka Miller, Jozef Sirán, Mária Zdímalová
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes. Discret. Math. 313 (19) (2013)
Encarnación Abajo, Camino Balbuena, Ana Diánez
}-free extremal graphs. Discret. Appl. Math. 160 (9) (2012)
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate
Families of small regular graphs of girth 5. Discret. Math. 312 (18) (2012)
Camino Balbuena, Julián Salas
A new bound for the connectivity of cages. Appl. Math. Lett. 25 (11) (2012)
Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano
Restricted arc-connectivity of generalized p-cycles. Discret. Appl. Math. 160 (9) (2012)
Gabriela Araujo-Pardo, Camino Balbuena
Constructions of small regular bipartite graphs of girth 6. Networks 57 (2) (2011)
Camino Balbuena, Diego González-Moreno, Julián Salas
Edge-superconnectivity of semiregular cages with odd girth. Networks 58 (3) (2011)
Camino Balbuena, Xavier Marcote
)-cages. Int. J. Comput. Math. 88 (7) (2011)
Gabriela Araujo-Pardo, Camino Balbuena, Luis Montejano, Juan Carlos Valenzuela
Partial linear spaces and identifying codes. Eur. J. Comb. 32 (3) (2011)
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano, Julián Salas
-optimality in graphs with odd girth g and even girth h. Appl. Math. Lett. 24 (7) (2011)
Camino Balbuena, Xavier Marcote
Monotonicity of the order of (D;g)-cages. Appl. Math. Lett. 24 (11) (2011)
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano
Superconnectivity of graphs with odd girth g and even girth h. Discret. Appl. Math. 159 (2-3) (2011)
Julián Salas, Camino Balbuena
New results on connectivity of cages. Electron. Notes Discret. Math. 38 (2011)
Camino Balbuena, Miguel A. Guevara
Kernels and partial line digraphs. Appl. Math. Lett. 23 (10) (2010)
Marién Abreu, Camino Balbuena, Domenico Labbate
-free graphs of large size. Des. Codes Cryptogr. 55 (2-3) (2010)
Camino Balbuena, Kim Marshall, Luis Pedro Montejano
On the connectivity and superconnected graphs with small diameter. Discret. Appl. Math. 158 (5) (2010)
Camino Balbuena, Diego González-Moreno, Xavier Marcote
On the connectivity of semiregular cages. Networks 56 (1) (2010)
Gabriela Araujo-Pardo, Camino Balbuena, Tamás Héger
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. Discret. Math. 310 (8) (2010)
Camino Balbuena, Xavier Marcote, Diego González-Moreno
Some properties of semiregular cages. Discret. Math. Theor. Comput. Sci. 12 (5) (2010)
Encarnación Abajo, Camino Balbuena, Ana Diánez
New families of graphs without short cycles and large size. Discret. Appl. Math. 158 (11) (2010)
Camino Balbuena, Pedro García-Vázquez
Edge fault tolerance analysis of super k-restricted connected networks. Appl. Math. Comput. 216 (2) (2010)
Camino Balbuena, Diego González-Moreno, Xavier Marcote
On the 3-restricted edge connectivity of permutation graphs. Discret. Appl. Math. 157 (7) (2009)
Gabriela Araujo-Pardo, Camino Balbuena, Juan Carlos Valenzuela
Constructions of bi-regular cages. Discret. Math. 309 (6) (2009)
Yuqing Lin, Camino Balbuena, Mirka Miller
On the number of components of (k, g)-cages after vertex deletion. Discret. Appl. Math. 157 (8) (2009)
Jianmin Tang, Yuqing Lin, Camino Balbuena, Mirka Miller
}). Discret. Appl. Math. 157 (9) (2009)
Camino Balbuena, M. I. Ortego
The distribution of extremes in the degree sequence: A Gumbel distribution approach. Appl. Math. Lett. 22 (4) (2009)
Gabriela Araujo-Pardo, Camino Balbuena, Mika Olsen
On (k, g; l)-dicages. Ars Comb. 92 (2009)
Camino Balbuena
A method for obtaining small regular bipartite graphs of girth 8. Discret. Math. Theor. Comput. Sci. 11 (2) (2009)
Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez
On the Superconnectivity in graphs with odd girth g and even girth h. Electron. Notes Discret. Math. 34 (2009)
Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin
Superconnectivity of regular graphs with small diameter. Discret. Appl. Math. 157 (7) (2009)
Gabriela Araujo-Pardo, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
On the order of ({r, m};g)-cages of even girth. Discret. Math. 308 (12) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
Connectivity measures in matched sum graphs. Discret. Math. 308 (10) (2008)
Yuqing Lin, Camino Balbuena, Xavier Marcote, Mirka Miller
On the connectivity of (k, g)-cages of even girth. Discret. Math. 308 (15) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Extremal K(s, t)-free Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Camino Balbuena
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices. SIAM J. Discret. Math. 22 (4) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Conditional diameter saturated graphs. Networks 52 (4) (2008)
Camino Balbuena, Yuqing Lin, Mirka Miller
Diameter-sufficient conditions for a graph to be super-restricted connected. Discret. Appl. Math. 156 (15) (2008)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. Discret. Math. 308 (16) (2008)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
On the girth of extremal graphs without shortest cycles. Discret. Math. 308 (23) (2008)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
New results on the Zarankiewicz problem. Discret. Math. 307 (17-18) (2007)
Camino Balbuena, Pedro García-Vázquez
-path graphs being r-connected. Discret. Appl. Math. 155 (13) (2007)
Camino Balbuena, Xavier Marcote
Lower connectivities of regular graphs with small diameter. Discret. Math. 307 (11-12) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
New exact values of the maximum size of graphs free of topological complete subgraphs. Discret. Math. 307 (9-10) (2007)
Jianmin Tang, Camino Balbuena, Yuqing Lin, Mirka Miller
An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected. CATS (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Extremal bipartite graphs with high girth. Ars Comb. 83 (2007)
Camino Balbuena, Pedro García-Vázquez
On the Minimum Order of Extremal Graphs to have a Prescribed Girth. SIAM J. Discret. Math. 21 (1) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
-free bipartite graphs. Discret. Math. 307 (6) (2007)
Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
On the connectivity of cages with girth five, six and eight. Discret. Math. 307 (11-12) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
On the edge-connectivity and restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 155 (18) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
On the restricted connectivity and superconnectivity in graphs with given girth. Discret. Math. 307 (6) (2007)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
Trees having an even or quasi even degree sequence are graceful. Appl. Math. Lett. 20 (4) (2007)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
Connectivity of graphs with given girth pair. Discret. Math. 307 (2) (2007)
Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller
A lower bound on the order of regular graphs with given girth pair. J. Graph Theory 55 (2) (2007)
Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez
Edge-connectivity and edge-superconnectivity in sequence graphs. Discret. Appl. Math. 155 (16) (2007)
Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote
)-cages are edge-superconnected. Networks 47 (2) (2006)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
Reliability of interconnection networks modeled by a product of graphs. Networks 48 (3) (2006)
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
. J. Graph Theory 52 (1) (2006)
Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela
On extremal bipartite graphs with high girth. Electron. Notes Discret. Math. 26 (2006)
Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela
Highly connected star product graphs. Electron. Notes Discret. Math. 26 (2006)
Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
-free bipartite graphs. Electron. Notes Discret. Math. 26 (2006)
Camino Balbuena, E. Barker, K. C. Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, Kiki A. Sugeng, Michal Tkác
On the degrees of a strongly vertex-magic graph. Discret. Math. 306 (6) (2006)
Camino Balbuena, E. Barker, Yuqing Lin, Mirka Miller, Kiki A. Sugeng
Consecutive magic graphs. Discret. Math. 306 (16) (2006)
Camino Balbuena, Gabriela Araujo-Pardo, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
On the order of bi-regular cages of even girth. Electron. Notes Discret. Math. 26 (2006)
Camino Balbuena, Xavier Marcote, Pedro García-Vázquez
On restricted connectivities of permutation graphs. Networks 45 (3) (2005)
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
-optimality of graphs with small conditional diameter. Inf. Process. Lett. 95 (4) (2005)
Xavier Marcote, Camino Balbuena, Josep Fàbrega
Connectedness of digraphs and graphs under constraints on the conditional diameter. Networks 45 (2) (2005)
Yuqing Lin, Mirka Miller, Camino Balbuena
)-cages. Discret. Math. 299 (1-3) (2005)

Camino Balbuena.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Camino Balbuena