Camino Balbuena

From MaRDI portal
Revision as of 01:58, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Camino Balbuena to Camino Balbuena: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:270264

Available identifiers

zbMath Open balbuena.caminoDBLPb/CaminoBalbuenaWikidataQ77862729 ScholiaQ77862729MaRDI QIDQ270264

List of research outcomes





PublicationDate of PublicationType
Bounds on the acyclic disconnection of a digraph2024-12-27Paper
Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code2021-07-21Paper
Identifying codes in line digraphs2020-06-17Paper
The \(p\)-restricted edge-connectivity of Kneser graphs2019-11-22Paper
Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments2019-11-12Paper
An alternate description of a (q + 1, 8)-cage2019-10-02Paper
Improving bounds on the order of regular graphs of girth 52019-08-12Paper
About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs2019-07-04Paper
Characterizing identifying codes from the spectrum of a graph or digraph2019-05-29Paper
Rainbow connectivity of Moore cages of girth 62018-10-26Paper
Elliptic semiplanes and regular graphs with girth 52018-10-11Paper
Vertex disjoint 4-cycles in bipartite tournaments2018-02-23Paper
Advances on the Conjecture of Erd\H{o}s-S\'os for spiders2017-06-11Paper
New small regular graphs of girth 52017-05-22Paper
Vertex-disjoint cycles in bipartite tournaments2017-02-13Paper
New family of small regular graphs of girth 52017-02-13Paper
A construction of dense mixed graphs of diameter 22017-02-13Paper
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs2017-02-13Paper
A family of mixed graphs with large order and diameter 22016-12-28Paper
A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\)2016-04-07Paper
Total domination edge critical graphs with total domination number three and many dominating pairs2015-09-24Paper
Small regular graphs of girth 72015-08-27Paper
On a conjecture on the order of cages with a given girth pair2015-07-06Paper
On the acyclic disconnection and the girth2015-05-22Paper
Locating-dominating sets and identifying codes in graphs of girth at least 52015-05-18Paper
A construction of small \((q-1)\)-regular graphs of girth 82015-04-22Paper
A formulation of a (q+1,8)-cage2015-01-11Paper
On the connectivity and restricted edge-connectivity of 3-arc graphs2014-09-12Paper
Structural properties of CKI-digraphs2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q54200162014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q53967492014-02-03Paper
On the order of graphs with a given girth pair2014-01-27Paper
On bi-regular cages of even girth at least 82013-12-23Paper
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes2013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28573252013-11-01Paper
On the Superconnectivity in graphs with odd girth g and even girth h2013-10-10Paper
On the super‐restricted arc‐connectivity of s ‐geodetic digraphs2013-08-06Paper
Biregular cages of girth five2013-06-07Paper
A note on the upper bound and girth pair of (\(k;g\))-cages2013-04-18Paper
On second order degree of graphs2013-03-14Paper
On superconnectivity of (\(4, g\))-cages2013-02-25Paper
The \(k\)-restricted edge-connectivity of a product of graphs2012-11-22Paper
A new bound for the connectivity of cages2012-10-17Paper
Families of small regular graphs of girth 52012-09-12Paper
New results on 3-domination critical graphs2012-08-13Paper
Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs2012-05-30Paper
Restricted arc-connectivity of generalized \(p\)-cycles2012-05-30Paper
https://portal.mardi4nfdi.de/entity/Q31055262012-01-05Paper
Monotonicity of the order of \((D;g)\)-cages2011-12-28Paper
Edge-superconnectivity of semiregular cages with odd girth2011-11-21Paper
An explicit formula for obtaining $(q+1,8)$-cages and others small regular graphs of girth 82011-11-14Paper
Topological minors in bipartite graphs2011-11-04Paper
https://portal.mardi4nfdi.de/entity/Q30117662011-06-29Paper
A sufficient degree condition for a graph to contain all trees of size \(k\)2011-06-24Paper
Diameter and connectivity of (D; g)-cages2011-06-15Paper
On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)2011-05-03Paper
Constructions of small regular bipartite graphs of girth 62011-03-16Paper
Partial linear spaces and identifying codes2011-03-04Paper
Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)2011-01-21Paper
On the connectivity of semiregular cages2010-11-24Paper
On the restricted arc-connectivity of \(s\)-geodetic digraphs2010-10-29Paper
New families of graphs without short cycles and large size2010-10-11Paper
Kernels and partial line digraphs2010-09-01Paper
https://portal.mardi4nfdi.de/entity/Q35754292010-07-27Paper
https://portal.mardi4nfdi.de/entity/Q35754572010-07-27Paper
Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size2010-05-19Paper
On the connectivity and superconnected graphs with small diameter2010-05-05Paper
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages2010-04-27Paper
Edge fault tolerance analysis of super \(k\)-restricted connected networks2010-04-14Paper
Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter2009-12-04Paper
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices2009-11-27Paper
Superconnectivity of regular graphs with small diameter2009-06-30Paper
On the 3-restricted edge connectivity of permutation graphs2009-06-30Paper
Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)2009-06-24Paper
On the number of components of \((k,g)\)-cages after vertex deletion2009-06-24Paper
Constructions of bi-regular cages2009-06-17Paper
The distribution of extremes in the degree sequence: A Gumbel distribution approach2009-06-09Paper
https://portal.mardi4nfdi.de/entity/Q36258382009-05-22Paper
https://portal.mardi4nfdi.de/entity/Q36258392009-05-22Paper
https://portal.mardi4nfdi.de/entity/Q36258402009-05-22Paper
https://portal.mardi4nfdi.de/entity/Q36249552009-05-06Paper
Diameter-sufficient conditions for a graph to be super-restricted connected2009-03-09Paper
https://portal.mardi4nfdi.de/entity/Q36061162009-02-26Paper
https://portal.mardi4nfdi.de/entity/Q36061192009-02-26Paper
https://portal.mardi4nfdi.de/entity/Q36061212009-02-26Paper
https://portal.mardi4nfdi.de/entity/Q36061442009-02-26Paper
Trees having an even or quasi even degree sequence are graceful2009-02-12Paper
On the girth of extremal graphs without shortest cycles2009-01-28Paper
Conditional diameter saturated graphs2008-12-17Paper
Connectivity measures in matched sum graphs2008-11-12Paper
On the connectivity of \((k,g)\)-cages of even girth2008-07-11Paper
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs2008-07-11Paper
On the order of \((\{r,m\};g)\)-cages of even girth2008-05-13Paper
On the Minimum Order of Extremal Graphs to have a Prescribed Girth2008-03-28Paper
On the edge-connectivity and restricted edge-connectivity of a product of graphs2007-11-30Paper
Edge-connectivity and edge-superconnectivity in sequence graphs2007-09-21Paper
A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected2007-09-18Paper
New results on the Zarankiewicz problem2007-08-23Paper
A lower bound on the order of regular graphs with given girth pair2007-06-11Paper
Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence2007-05-29Paper
Every Cubic Cage is quasi 4-connected2007-05-29Paper
On extremal bipartite graphs with high girth2007-05-29Paper
Highly connected star product graphs2007-05-29Paper
Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>-free bipartite graphs2007-05-29Paper
Lower connectivities of regular graphs with small diameter2007-04-26Paper
On the connectivity of cages with girth five, six and eight2007-04-26Paper
New exact values of the maximum size of graphs free of topological complete subgraphs2007-03-15Paper
On the restricted connectivity and superconnectivity in graphs with given girth2007-03-02Paper
Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs2007-03-02Paper
Reliability of interconnection networks modeled by a product of graphs2007-02-15Paper
Connectivity of graphs with given girth pair2007-02-13Paper
Sufficient conditions for λ′‐optimality in graphs with girth g2006-06-06Paper
All (k;g)‐cages are edge‐superconnected2006-05-16Paper
(\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected2005-10-24Paper
Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages2005-10-10Paper
On restricted connectivities of permutation graphs2005-06-01Paper
Diameter vulnerability of iterated line digraphs in terms of the girth2005-04-21Paper
Connectedness of digraphs and graphs under constraints on the conditional diameter2005-04-21Paper
Diameter, short paths and superconnectivity in digraphs2005-01-13Paper
Edge-connectivity in \(P_k\)-path graphs2004-11-22Paper
Edge-superconnectivity of cages2004-02-03Paper
Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs2003-08-19Paper
Using a progressive withdrawal procedure to study superconnectivity in digraphs2003-06-25Paper
Every cubic cage is quasi 4-connected2003-06-09Paper
Superconnected digraphs and graphs with small conditional diameters2002-07-01Paper
Extraconnectivity of \(s\)-geodetic digraphs and graphs1999-12-05Paper

Research outcomes over time

This page was built for person: Camino Balbuena