Camino Balbuena

123 papers Journal 121Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the edge-connectivity of the square of a graph.
Discret. Appl. Math.
Camino Balbuena, Peter Dankelmann
2021 J jnl
Sufficient conditions for a digraph to admit a
Discuss. Math. Graph Theory
Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona
2020 J jnl
Identifying codes in line digraphs.
Appl. Math. Comput.
Camino Balbuena, Cristina Dalfó, Berenice Martínez-Barona
2019 J jnl
About
Discuss. Math. Graph Theory
Camino Balbuena, Hortensia Galeana-Sánchez, Mucuy-kak Guevara
2019 J jnl
Improving bounds on the order of regular graphs of girth 5.
Discret. Math.
Encarnación Abajo, Camino Balbuena, Manuel Bendala, Xavier Marcote
2019 J jnl
The
Appl. Math. Comput.
Camino Balbuena, Xavier Marcote
2018 J jnl
An alternate description of a (q + 1, 8)-cage.
Art Discret. Appl. Math.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate
2018 J jnl
Bounds on the
Appl. Math. Comput.
Camino Balbuena, Diego González-Moreno, Mika Olsen
2018 J jnl
Elliptic semiplanes and regular graphs with girth 5.
Electron. Notes Discret. Math.
Encarnación Abajo, Camino Balbuena, Manuel Bendala
2018 J jnl
Rainbow connectivity of Moore cages of girth 6.
Discret. Appl. Math.
Camino Balbuena, Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen
2018 J jnl
Vertex disjoint 4-cycles in bipartite tournaments.
Discret. Math.
Camino Balbuena, Diego González-Moreno, Mika Olsen
2017 J jnl
A family of mixed graphs with large order and diameter 2.
Discret. Appl. Math.
Gabriela Araujo-Pardo, Camino Balbuena, Mirka Miller, Mária Zdímalová
2017 J jnl
New small regular graphs of girth 5.
Discret. Math.
Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala
2016 J jnl
A construction of dense mixed graphs of diameter 2.
Electron. Notes Discret. Math.
Gabriela Araujo-Pardo, Camino Balbuena, Mirka Miller, Mária Zdímalová
2016 J jnl
New family of small regular graphs of girth 5.
Electron. Notes Discret. Math.
Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala
2016 J jnl
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs.
Electron. Notes Discret. Math.
Mucuy-kak Guevara, Camino Balbuena, Hortensia Galeana-Sánchez
2016 J jnl
Vertex-disjoint cycles in bipartite tournaments.
Electron. Notes Discret. Math.
Diego González-Moreno, Camino Balbuena, Mika Olsen
2015 J jnl
A Construction of Small (q-1)-Regular Graphs of Girth 8.
Electron. J. Comb.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate
2015 J jnl
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5.
Electron. J. Comb.
Camino Balbuena, Florent Foucaud, Adriana Hansberg
2015 J jnl
On a conjecture on the order of cages with a given girth pair.
Discret. Appl. Math.
Camino Balbuena, Julián Salas
2015 J jnl
On the acyclic disconnection and the girth.
Discret. Appl. Math.
Camino Balbuena, Mika Olsen
2015 J jnl
Small Regular Graphs of Girth 7.
Electron. J. Comb.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Julián Salas
2015 J jnl
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs.
Graphs Comb.
Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning
2014 J jnl
Locating-dominating sets and identifying codes in graphs of girth at least 5.
CoRR
Camino Balbuena, Florent Foucaud, Adriana Hansberg
2014 J jnl
On the connectivity and restricted edge-connectivity of 3-arc graphs.
Discret. Appl. Math.
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano
2014 J jnl
On the order of graphs with a given girth pair.
Discret. Math.
Camino Balbuena, Julián Salas
2013 J jnl
A note on the upper bound and girth pair of (
Discret. Appl. Math.
Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros
2013 J jnl
Biregular Cages of Girth Five.
Electron. J. Comb.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Gloria López-Chávez
2013 J jnl
Bounds on the order of biregular graphs with even girth at least 8.
Electron. Notes Discret. Math.
Gloria López-Chávez, Gabriela Araujo-Pardo, Luis Montejano, Camino Balbuena
2013 J jnl
Constructions of biregular cages of girth five.
Electron. Notes Discret. Math.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Gloria López-Chávez
2013 J jnl
Families of small regular graphs of girth 7.
Electron. Notes Discret. Math.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate, Julián Salas
2013 J jnl
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.
Discret. Math.
Camino Balbuena, Mirka Miller, Jozef Sirán, Mária Zdímalová
2013 J jnl
On Superconnectivity of (4, g)-Cages.
Graphs Comb.
Hongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote
2013 J jnl
On the super-restricted arc-connectivity of
Networks
Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano
2013 J jnl
The k-restricted edge-connectivity of a product of graphs.
Discret. Appl. Math.
Camino Balbuena, Xavier Marcote
2012 J jnl
A new bound for the connectivity of cages.
Appl. Math. Lett.
Camino Balbuena, Julián Salas
2012 J jnl
Families of small regular graphs of girth 5.
Discret. Math.
Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate
2012 J jnl
Girth of {C
Discret. Appl. Math.
Encarnación Abajo, Camino Balbuena, Ana Diánez
2012 J jnl
Restricted arc-connectivity of generalized p-cycles.
Discret. Appl. Math.
Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano
2011 J jnl
Constructions of small regular bipartite graphs of girth 6.
Networks
Gabriela Araujo-Pardo, Camino Balbuena
2011 J jnl
Diameter and connectivity of (
Int. J. Comput. Math.
Camino Balbuena, Xavier Marcote
2011 J jnl
Edge-superconnectivity of semiregular cages with odd girth.
Networks
Camino Balbuena, Diego González-Moreno, Julián Salas
2011 J jnl
Monotonicity of the order of (D;g)-cages.
Appl. Math. Lett.
Camino Balbuena, Xavier Marcote
2011 J jnl
New results on connectivity of cages.
Electron. Notes Discret. Math.
Julián Salas, Camino Balbuena
2011 J jnl
On the λ
Appl. Math. Lett.
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano, Julián Salas
2011 J jnl
Partial linear spaces and identifying codes.
Eur. J. Comb.
Gabriela Araujo-Pardo, Camino Balbuena, Luis Montejano, Juan Carlos Valenzuela
2011 J jnl
Superconnectivity of graphs with odd girth g and even girth h.
Discret. Appl. Math.
Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano
2010 J jnl
Adjacency matrices of polarity graphs and of other
Des. Codes Cryptogr.
Marién Abreu, Camino Balbuena, Domenico Labbate
2010 J jnl
Edge fault tolerance analysis of super k-restricted connected networks.
Appl. Math. Comput.
Camino Balbuena, Pedro García-Vázquez
2010 J jnl
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages.
Discret. Math.
Gabriela Araujo-Pardo, Camino Balbuena, Tamás Héger
2010 J jnl
Kernels and partial line digraphs.
Appl. Math. Lett.
Camino Balbuena, Miguel A. Guevara
2010 J jnl
New families of graphs without short cycles and large size.
Discret. Appl. Math.
Encarnación Abajo, Camino Balbuena, Ana Diánez
2010 J jnl
On the connectivity and superconnected graphs with small diameter.
Discret. Appl. Math.
Camino Balbuena, Kim Marshall, Luis Pedro Montejano
2010 J jnl
On the connectivity of semiregular cages.
Networks
Camino Balbuena, Diego González-Moreno, Xavier Marcote
2010 J jnl
Some properties of semiregular cages.
Discret. Math. Theor. Comput. Sci.
Camino Balbuena, Xavier Marcote, Diego González-Moreno
2009 J jnl
A method for obtaining small regular bipartite graphs of girth 8.
Discret. Math. Theor. Comput. Sci.
Camino Balbuena
2009 J jnl
Calculating the extremal number ex(v;{C
Discret. Appl. Math.
Jianmin Tang, Yuqing Lin, Camino Balbuena, Mirka Miller
2009 J jnl
Constructions of bi-regular cages.
Discret. Math.
Gabriela Araujo-Pardo, Camino Balbuena, Juan Carlos Valenzuela
2009 J jnl
On (k, g; l)-dicages.
Ars Comb.
Gabriela Araujo-Pardo, Camino Balbuena, Mika Olsen
2009 J jnl
On the 3-restricted edge connectivity of permutation graphs.
Discret. Appl. Math.
Camino Balbuena, Diego González-Moreno, Xavier Marcote
2009 J jnl
On the Superconnectivity in graphs with odd girth g and even girth h.
Electron. Notes Discret. Math.
Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez
2009 J jnl
On the number of components of (k, g)-cages after vertex deletion.
Discret. Appl. Math.
Yuqing Lin, Camino Balbuena, Mirka Miller
2009 J jnl
Superconnectivity of regular graphs with small diameter.
Discret. Appl. Math.
Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin
2009 J jnl
The distribution of extremes in the degree sequence: A Gumbel distribution approach.
Appl. Math. Lett.
Camino Balbuena, M. I. Ortego
2008 J jnl
Conditional diameter saturated graphs.
Networks
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2008 J jnl
Connectivity measures in matched sum graphs.
Discret. Math.
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
2008 J jnl
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.
Discret. Math.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
2008 J jnl
Diameter-sufficient conditions for a graph to be super-restricted connected.
Discret. Appl. Math.
Camino Balbuena, Yuqing Lin, Mirka Miller
2008 J jnl
Extremal K(s, t)-free Bipartite Graphs.
Discret. Math. Theor. Comput. Sci.
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2008 J jnl
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices.
SIAM J. Discret. Math.
Camino Balbuena
2008 J jnl
On the connectivity of (k, g)-cages of even girth.
Discret. Math.
Yuqing Lin, Camino Balbuena, Xavier Marcote, Mirka Miller
2008 J jnl
On the girth of extremal graphs without shortest cycles.
Discret. Math.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
2008 J jnl
On the order of ({r, m};g)-cages of even girth.
Discret. Math.
Gabriela Araujo-Pardo, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2007 J jnl
A lower bound on the order of regular graphs with given girth pair.
J. Graph Theory
Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller
2007 J jnl
A sufficient condition for P
Discret. Appl. Math.
Camino Balbuena, Pedro García-Vázquez
2007 — conf
An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected.
CATS
Jianmin Tang, Camino Balbuena, Yuqing Lin, Mirka Miller
2007 J jnl
Connectivity of graphs with given girth pair.
Discret. Math.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
2007 J jnl
Counterexample to a conjecture of Györi on C
Discret. Math.
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2007 J jnl
Edge-connectivity and edge-superconnectivity in sequence graphs.
Discret. Appl. Math.
Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez
2007 J jnl
Extremal bipartite graphs with high girth.
Ars Comb.
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2007 J jnl
Lower connectivities of regular graphs with small diameter.
Discret. Math.
Camino Balbuena, Xavier Marcote
2007 J jnl
New exact values of the maximum size of graphs free of topological complete subgraphs.
Discret. Math.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez
2007 J jnl
New results on the Zarankiewicz problem.
Discret. Math.
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2007 J jnl
On the Minimum Order of Extremal Graphs to have a Prescribed Girth.
SIAM J. Discret. Math.
Camino Balbuena, Pedro García-Vázquez
2007 J jnl
On the connectivity of cages with girth five, six and eight.
Discret. Math.
Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
2007 J jnl
On the edge-connectivity and restricted edge-connectivity of a product of graphs.
Discret. Appl. Math.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
2007 J jnl
On the restricted connectivity and superconnectivity in graphs with given girth.
Discret. Math.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
2007 J jnl
Trees having an even or quasi even degree sequence are graceful.
Appl. Math. Lett.
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2006 J jnl
All (
Networks
Yuqing Lin, Mirka Miller, Camino Balbuena, Xavier Marcote
2006 J jnl
Consecutive magic graphs.
Discret. Math.
Camino Balbuena, Ewan Barker, Yuqing Lin, Mirka Miller, Kiki A. Sugeng
2006 J jnl
Extremal K
Electron. Notes Discret. Math.
Juan Carlos Valenzuela, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
2006 J jnl
Highly connected star product graphs.
Electron. Notes Discret. Math.
Xavier Marcote, Camino Balbuena, Pedro García-Vázquez, Juan Carlos Valenzuela
2006 J jnl
On extremal bipartite graphs with high girth.
Electron. Notes Discret. Math.
Pedro García-Vázquez, Camino Balbuena, Xavier Marcote, Juan Carlos Valenzuela
2006 J jnl
On the degrees of a strongly vertex-magic graph.
Discret. Math.
Camino Balbuena, Ewan Barker, Kinkar Chandra Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, Kiki A. Sugeng, Michal Tkác
2006 J jnl
On the order of bi-regular cages of even girth.
Electron. Notes Discret. Math.
Camino Balbuena, Gabriela Araujo-Pardo, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
2006 J jnl
Reliability of interconnection networks modeled by a product of graphs.
Networks
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
2006 J jnl
Sufficient conditions for lambda'-optimality in graphs with girth
J. Graph Theory
Camino Balbuena, Pedro García-Vázquez, Xavier Marcote
2005 J jnl
(
Discret. Math.
Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo, Josep Fàbrega
2005 J jnl
Connectedness of digraphs and graphs under constraints on the conditional diameter.
Networks
Xavier Marcote, Camino Balbuena, Josep Fàbrega
2005 J jnl
Diameter vulnerability of iterated line digraphs in terms of the girth.
Networks
Camino Balbuena, Xavier Marcote, Daniela Ferrero
2005 J jnl
Improved lower bound for the vertex connectivity of (
Discret. Math.
Yuqing Lin, Mirka Miller, Camino Balbuena
2005 J jnl
On restricted connectivities of permutation graphs.
Networks
Camino Balbuena, Xavier Marcote, Pedro García-Vázquez
2005 J jnl
Sufficient conditions for
Inf. Process. Lett.
Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
2004 J jnl
Diameter, short paths and superconnectivity in digraphs.
Discret. Math.
Xavier Marcote, Camino Balbuena, Ignacio M. Pelayo
2004 J jnl
Edge-connectivity in
Discret. Math.
Camino Balbuena, Pedro García-Vázquez
2004 J jnl
Edge-superconnectivity of cages.
Networks
Xavier Marcote, Camino Balbuena
2003 J jnl
Algebraic properties of a digraph and its line digraph.
J. Interconnect. Networks
Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo
2003 J jnl
Diameter vulnerability of GC graphs.
Discret. Appl. Math.
José Gómez, Ignacio M. Pelayo, Camino Balbuena
2003 J jnl
Edge-connectivity and super edge-connectivity of
Discret. Math.
Camino Balbuena, Daniela Ferrero
2003 J jnl
Every cubic cage is quasi 4-connected.
Discret. Math.
Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena
2003 J jnl
Using a progressive withdrawal procedure to study superconnectivity in digraphs.
Discret. Math.
Ignacio M. Pelayo, Xavier Marcote, Camino Balbuena, Josep Fàbrega
2002 J jnl
On the superconnectivity of generalized
Discret. Math.
Camino Balbuena, Ignacio M. Pelayo, José Gómez
2002 J jnl
Superconnected digraphs and graphs with small conditional diameters.
Networks
Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo
2001 J jnl
Every Cubic Cage is quasi 4-connected.
Electron. Notes Discret. Math.
Xavier Marcote, Ignacio M. Pelayo, Camino Balbuena
2001 J jnl
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs.
Ars Comb.
Camino Balbuena, Ángeles Carmona
2001 J jnl
On the connectivity of generalized p-cycles.
Ars Comb.
Ignacio M. Pelayo, Camino Balbuena, José Gómez
2001 J jnl
Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence.
Electron. Notes Discret. Math.
Camino Balbuena
1999 J jnl
Extraconnectivity of s-geodetic digraphs and graphs.
Discret. Math.
Camino Balbuena
1999 J jnl
New large graphs with given degree and diameter six.
Networks
José Gómez, Ignacio M. Pelayo, Camino Balbuena
1999 J jnl
Superconnectivity of bipartite digraphs and graphs.
Discret. Math.
Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol
1997 J jnl
Extraconnectivity of graphs with large minimum degree and girth.
Discret. Math.
Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol
1996 J jnl
On the connectivity and the conditional diameter of graphs and digraphs.
Networks
Camino Balbuena, Ángeles Carmona, Josep Fàbrega, Miguel Angel Fiol
1995 — —
Estudio sobre algunas nuevas clases de conectividad condicional en grafos dirigidos.
Camino Balbuena