Camino Balbuena

,

Peter Dankelmann

Discret. Appl. Math., 2025

Sufficient conditions for a digraph to admit a (1, \le l)-identifying code.

[BibT_eX]

[DOI]

,

Cristina Dalfó

,

Berenice Martínez-Barona

Discuss. Math. Graph Theory, 2021

Identifying codes in line digraphs.

[BibT_eX]

[DOI]

,

Cristina Dalfó

,

Berenice Martínez-Barona

Appl. Math. Comput., 2020

About (k, l)-kernels, semikernels and Grundy functions in partial line digraphs.

[BibT_eX]

[DOI]

Hortensia Galeana-Sánchez

,

,

Mucuy-kak Guevara

Discuss. Math. Graph Theory, 2019

Improving bounds on the order of regular graphs of girth 5.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2019

The p-restricted edge-connectivity of Kneser graphs.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2019

Elliptic semiplanes and regular graphs with girth 5.

[BibT_eX]

[DOI]

,

,

Manuel Bendala

Electron. Notes Discret. Math., 2018

Vertex disjoint 4-cycles in bipartite tournaments.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2018

Rainbow connectivity of Moore cages of girth 6.

[BibT_eX]

[DOI]

,

Julián Fresán-Figueroa

,

,

Discret. Appl. Math., 2018

Bounds on the k-restricted arc connectivity of some bipartite tournaments.

[BibT_eX]

[DOI]

,

,

Appl. Math. Comput., 2018

An alternate description of a (q + 1, 8)-cage.

[BibT_eX]

[DOI]

,

,

,

Art Discret. Appl. Math., 2018

New small regular graphs of girth 5.

[BibT_eX]

[DOI]

,

,

,

Manuel Bendala

Discret. Math., 2017

A family of mixed graphs with large order and diameter 2.

[BibT_eX]

[DOI]

,

,

,

Mária Zdímalová

Discret. Appl. Math., 2017

Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs.

[BibT_eX]

[DOI]

Mucuy-kak Guevara

,

Hortensia Galeana-Sánchez

,

Electron. Notes Discret. Math., 2016

Vertex-disjoint cycles in bipartite tournaments.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2016

A construction of dense mixed graphs of diameter 2.

[BibT_eX]

[DOI]

,

,

,

Mária Zdímalová

Electron. Notes Discret. Math., 2016

New family of small regular graphs of girth 5.

[BibT_eX]

[DOI]

,

,

,

Manuel Bendala

Electron. Notes Discret. Math., 2016

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2015

On a conjecture on the order of cages with a given girth pair.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2015

On the acyclic disconnection and the girth.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2015

Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5.

[BibT_eX]

[DOI]

,

Florent Foucaud

,

Adriana Hansberg

Electron. J. Comb., 2015

Small Regular Graphs of Girth 7.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2015

A Construction of Small (q-1)-Regular Graphs of Girth 8.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2015

On the order of graphs with a given girth pair.

[BibT_eX]

[DOI]

,

Discret. Math., 2014

On the connectivity and restricted edge-connectivity of 3-arc graphs.

[BibT_eX]

[DOI]

,

,

Luis Pedro Montejano

Discret. Appl. Math., 2014

On the super-restricted arc-connectivity of s -geodetic digraphs.

[BibT_eX]

[DOI]

,

,

,

Networks, 2013

On Superconnectivity of (4, g)-Cages.

[BibT_eX]

[DOI]

,

,

,

,

,

Graphs Comb., 2013

Bounds on the order of biregular graphs with even girth at least 8.

[BibT_eX]

[DOI]

Gloria López-Chávez

,

,

Luis Montejano

,

Electron. Notes Discret. Math., 2013

Families of small regular graphs of girth 7.

[BibT_eX]

[DOI]

,

,

,

,

Electron. Notes Discret. Math., 2013

Constructions of biregular cages of girth five.

[BibT_eX]

[DOI]

,

,

,

,

Gloria López-Chávez

Electron. Notes Discret. Math., 2013

Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2013

The k-restricted edge-connectivity of a product of graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

A note on the upper bound and girth pair of (k;g)-cages.

[BibT_eX]

[DOI]

,

Juan José Montellano-Ballesteros

,

Discret. Appl. Math., 2013

Biregular Cages of Girth Five.

[BibT_eX]

[DOI]

,

,

,

,

Gloria López-Chávez

Electron. J. Comb., 2013

Families of small regular graphs of girth 5.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2012

Restricted arc-connectivity of generalized p-cycles.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2012

Girth of {C3, ..., Cs}-free extremal graphs.

[BibT_eX]

[DOI]

,

,

Ana Diánez

Discret. Appl. Math., 2012

A new bound for the connectivity of cages.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2012

Edge-superconnectivity of semiregular cages with odd girth.

[BibT_eX]

[DOI]

,

,

Networks, 2011

Constructions of small regular bipartite graphs of girth 6.

[BibT_eX]

[DOI]

,

Networks, 2011

Diameter and connectivity of (D; g)-cages.

[BibT_eX]

[DOI]

,

Int. J. Comput. Math., 2011

New results on connectivity of cages.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2011

Partial linear spaces and identifying codes.

[BibT_eX]

[DOI]

,

,

Luis Montejano

,

Eur. J. Comb., 2011

Monotonicity of the order of (D;g)-cages.

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2011

On the λ′-optimality in graphs with odd girth g and even girth h.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2011

On the connectivity of semiregular cages.

[BibT_eX]

[DOI]

,

,

Networks, 2010

Some properties of semiregular cages.

[BibT_eX]

[DOI]

,

,

Discret. Math. Theor. Comput. Sci., 2010

Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages.

[BibT_eX]

[DOI]

,

,

Tamás Héger

Discret. Math., 2010

Adjacency matrices of polarity graphs and of other C4-free graphs of large size.

[BibT_eX]

[DOI]

,

,

Des. Codes Cryptogr., 2010

On the connectivity and superconnected graphs with small diameter.

[BibT_eX]

[DOI]

,

Kim Marshall

,

Luis Pedro Montejano

Discret. Appl. Math., 2010

New families of graphs without short cycles and large size.

[BibT_eX]

[DOI]

,

,

Ana Diánez

Discret. Appl. Math., 2010

Kernels and partial line digraphs.

[BibT_eX]

[DOI]

,

Miguel A. Guevara

Appl. Math. Lett., 2010

Edge fault tolerance analysis of super k-restricted connected networks.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2010

On the Superconnectivity in graphs with odd girth g and even girth h.

[BibT_eX]

[DOI]

Luis Pedro Montejano

,

,

Electron. Notes Discret. Math., 2009

A method for obtaining small regular bipartite graphs of girth 8.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

Constructions of bi-regular cages.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

Calculating the extremal number ex(v;{C3, C4, ..., Cn}).

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2009

On the number of components of (k, g)-cages after vertex deletion.

[BibT_eX]

[DOI]

Yuqing Lin

,

,

Discret. Appl. Math., 2009

Superconnectivity of regular graphs with small diameter.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2009

On the 3-restricted edge connectivity of permutation graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2009

On (k, g; l)-dicages.

[BibT_eX]

,

,

Ars Comb., 2009

The distribution of extremes in the degree sequence: A Gumbel distribution approach.

[BibT_eX]

[DOI]

,

M. I. Ortego

Appl. Math. Lett., 2009

Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Conditional diameter saturated graphs.

[BibT_eX]

[DOI]

,

,

,

Networks, 2008

Extremal K(s, t)-free Bipartite Graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2008

On the connectivity of (k, g)-cages of even girth.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Connectivity measures in matched sum graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2008

Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2008

On the girth of extremal graphs without shortest cycles.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

On the order of ({r, m};g)-cages of even girth.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2008

Diameter-sufficient conditions for a graph to be super-restricted connected.

[BibT_eX]

[DOI]

,

Yuqing Lin

,

Discret. Appl. Math., 2008

On the Minimum Order of Extremal Graphs to have a Prescribed Girth.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2007

A lower bound on the order of regular graphs with given girth pair.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2007

On the connectivity of cages with girth five, six and eight.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2007

Lower connectivities of regular graphs with small diameter.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

New results on the Zarankiewicz problem.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2007

Counterexample to a conjecture of Györi on C2l-free bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2007

On the restricted connectivity and superconnectivity in graphs with given girth.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2007

Connectivity of graphs with given girth pair.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2007

New exact values of the maximum size of graphs free of topological complete subgraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2007

A sufficient condition for Pk-path graphs being r-connected.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2007

Edge-connectivity and edge-superconnectivity in sequence graphs.

[BibT_eX]

[DOI]

,

Josep Fàbrega

,

Discret. Appl. Math., 2007

On the edge-connectivity and restricted edge-connectivity of a product of graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2007

Trees having an even or quasi even degree sequence are graceful.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2007

All (k;g)-cages are edge-superconnected.

[BibT_eX]

[DOI]

,

,

,

Networks, 2006

Reliability of interconnection networks modeled by a product of graphs.

[BibT_eX]

[DOI]

,

,

Networks, 2006

Sufficient conditions for lambda'-optimality in graphs with girth g.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2006

Extremal K(s, t)-free bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2006

Highly connected star product graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2006

On extremal bipartite graphs with high girth.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2006

On the order of bi-regular cages of even girth.

[BibT_eX]

[DOI]

,

,

,

,

Electron. Notes Discret. Math., 2006

Consecutive magic graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2006

On the degrees of a strongly vertex-magic graph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

Discret. Math., 2006

Connectedness of digraphs and graphs under constraints on the conditional diameter.

[BibT_eX]

[DOI]

,

,

Josep Fàbrega

Networks, 2005

On restricted connectivities of permutation graphs.

[BibT_eX]

[DOI]

,

,

Networks, 2005

Diameter vulnerability of iterated line digraphs in terms of the girth.

[BibT_eX]

[DOI]

,

,

Daniela Ferrero

Networks, 2005

Sufficient conditions for lambda'-optimality of graphs with small conditional diameter.

[BibT_eX]

[DOI]

,

,

,

,

Inf. Process. Lett., 2005

(delta, g)-cages with g geq 10 are 4-connected.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2005

Improved lower bound for the vertex connectivity of (delta;;g)-cages.

[BibT_eX]

[DOI]

Yuqing Lin

,

,

Discret. Math., 2005

Edge-superconnectivity of cages.

[BibT_eX]

[DOI]

,

Networks, 2004

Diameter, short paths and superconnectivity in digraphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2004

Edge-connectivity in Pk-path graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2004

Algebraic properties of a digraph and its line digraph.

[BibT_eX]

[DOI]

,

,

,

J. Interconnect. Networks, 2003

Using a progressive withdrawal procedure to study superconnectivity in digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2003

Edge-connectivity and super edge-connectivity of P2-path graphs.

[BibT_eX]

[DOI]

,

Daniela Ferrero

Discret. Math., 2003

Diameter vulnerability of GC graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2003

Superconnected digraphs and graphs with small conditional diameters.

[BibT_eX]

[DOI]

,

,

,

Networks, 2002

On the superconnectivity of generalized p-cycles.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2002

Every Cubic Cage is quasi 4-connected.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2001

Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On the connectivity of generalized p-cycles.

[BibT_eX]

,

,

Ars Comb., 2001

On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs.

[BibT_eX]

,

Ángeles Carmona

Ars Comb., 2001

New large graphs with given degree and diameter six.

[BibT_eX]

[DOI]

,

,

Networks, 1999

Superconnectivity of bipartite digraphs and graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 1999

Extraconnectivity of s-geodetic digraphs and graphs.

[BibT_eX]

[DOI]