2021
Sufficient conditions for a digraph to admit a <i>(1, \le l)</i>-identifying code.
Discuss. Math. Graph Theory, 2021
2020
Identifying codes in line digraphs.
Appl. Math. Comput., 2020
2019
About <i>(k, l)</i>-kernels, semikernels and Grundy functions in partial line digraphs.
Discuss. Math. Graph Theory, 2019
Improving bounds on the order of regular graphs of girth 5.
Discret. Math., 2019
The <i>p</i>-restricted edge-connectivity of Kneser graphs.
Appl. Math. Comput., 2019
2018
Elliptic semiplanes and regular graphs with girth 5.
Electron. Notes Discret. Math., 2018
Vertex disjoint 4-cycles in bipartite tournaments.
Discret. Math., 2018
Rainbow connectivity of Moore cages of girth 6.
Discret. Appl. Math., 2018
Bounds on the <i>k</i>-restricted arc connectivity of some bipartite tournaments.
Appl. Math. Comput., 2018
An alternate description of a (q + 1, 8)-cage.
Art Discret. Appl. Math., 2018
2017
New small regular graphs of girth 5.
Discret. Math., 2017
A family of mixed graphs with large order and diameter 2.
Discret. Appl. Math., 2017
2016
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs.
Electron. Notes Discret. Math., 2016
Vertex-disjoint cycles in bipartite tournaments.
Electron. Notes Discret. Math., 2016
A construction of dense mixed graphs of diameter 2.
Electron. Notes Discret. Math., 2016
New family of small regular graphs of girth 5.
Electron. Notes Discret. Math., 2016
2015
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs.
Graphs Comb., 2015
On a conjecture on the order of cages with a given girth pair.
Discret. Appl. Math., 2015
On the acyclic disconnection and the girth.
Discret. Appl. Math., 2015
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5.
Electron. J. Comb., 2015
Small Regular Graphs of Girth 7.
Electron. J. Comb., 2015
A Construction of Small (q-1)-Regular Graphs of Girth 8.
Electron. J. Comb., 2015
2014
On the order of graphs with a given girth pair.
Discret. Math., 2014
On the connectivity and restricted edge-connectivity of 3-arc graphs.
Discret. Appl. Math., 2014
2013
On the super-restricted arc-connectivity of <i>s</i> -geodetic digraphs.
Networks, 2013
On Superconnectivity of (4, g)-Cages.
Graphs Comb., 2013
Bounds on the order of biregular graphs with even girth at least 8.
Electron. Notes Discret. Math., 2013
Families of small regular graphs of girth 7.
Electron. Notes Discret. Math., 2013
Constructions of biregular cages of girth five.
Electron. Notes Discret. Math., 2013
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.
Discret. Math., 2013
The k-restricted edge-connectivity of a product of graphs.
Discret. Appl. Math., 2013
A note on the upper bound and girth pair of (<i>k</i>;<i>g</i>)-cages.
Discret. Appl. Math., 2013
Biregular Cages of Girth Five.
Electron. J. Comb., 2013
2012
Families of small regular graphs of girth 5.
Discret. Math., 2012
Restricted arc-connectivity of generalized p-cycles.
Discret. Appl. Math., 2012
Girth of {C<sub>3</sub>, ..., C<sub>s</sub>}-free extremal graphs.
Discret. Appl. Math., 2012
A new bound for the connectivity of cages.
Appl. Math. Lett., 2012
2011
Edge-superconnectivity of semiregular cages with odd girth.
Networks, 2011
Constructions of small regular bipartite graphs of girth 6.
Networks, 2011
Diameter and connectivity of (<i>D; g</i>)-cages.
Int. J. Comput. Math., 2011
New results on connectivity of cages.
Electron. Notes Discret. Math., 2011
Partial linear spaces and identifying codes.
Eur. J. Comb., 2011
Monotonicity of the order of (D;g)-cages.
Appl. Math. Lett., 2011
On the λ<sup>′</sup>-optimality in graphs with odd girth g and even girth h.
Appl. Math. Lett., 2011
2010
On the connectivity of semiregular cages.
Networks, 2010
Some properties of semiregular cages.
Discret. Math. Theor. Comput. Sci., 2010
Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages.
Discret. Math., 2010
Adjacency matrices of polarity graphs and of other <i>C</i><sub>4</sub>-free graphs of large size.
Des. Codes Cryptogr., 2010
On the connectivity and superconnected graphs with small diameter.
Discret. Appl. Math., 2010
New families of graphs without short cycles and large size.
Discret. Appl. Math., 2010
Kernels and partial line digraphs.
Appl. Math. Lett., 2010
Edge fault tolerance analysis of super k-restricted connected networks.
Appl. Math. Comput., 2010
2009
On the Superconnectivity in graphs with odd girth g and even girth h.
Electron. Notes Discret. Math., 2009
A method for obtaining small regular bipartite graphs of girth 8.
Discret. Math. Theor. Comput. Sci., 2009
Constructions of bi-regular cages.
Discret. Math., 2009
Calculating the extremal number ex(v;{C<sub>3</sub>, C<sub>4</sub>, ..., C<sub>n</sub>}).
Discret. Appl. Math., 2009
On the number of components of (k, g)-cages after vertex deletion.
Discret. Appl. Math., 2009
Superconnectivity of regular graphs with small diameter.
Discret. Appl. Math., 2009
On the 3-restricted edge connectivity of permutation graphs.
Discret. Appl. Math., 2009
The distribution of extremes in the degree sequence: A Gumbel distribution approach.
Appl. Math. Lett., 2009
2008
Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices.
SIAM J. Discret. Math., 2008
Conditional diameter saturated graphs.
Networks, 2008
Extremal K(s, t)-free Bipartite Graphs.
Discret. Math. Theor. Comput. Sci., 2008
On the connectivity of (k, g)-cages of even girth.
Discret. Math., 2008
Connectivity measures in matched sum graphs.
Discret. Math., 2008
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.
Discret. Math., 2008
On the girth of extremal graphs without shortest cycles.
Discret. Math., 2008
On the order of ({r, m};g)-cages of even girth.
Discret. Math., 2008
Diameter-sufficient conditions for a graph to be super-restricted connected.
Discret. Appl. Math., 2008
2007
On the Minimum Order of Extremal Graphs to have a Prescribed Girth.
SIAM J. Discret. Math., 2007
A lower bound on the order of regular graphs with given girth pair.
J. Graph Theory, 2007
On the connectivity of cages with girth five, six and eight.
Discret. Math., 2007
Lower connectivities of regular graphs with small diameter.
Discret. Math., 2007
New results on the Zarankiewicz problem.
Discret. Math., 2007
Counterexample to a conjecture of Györi on C<sub>2l</sub>-free bipartite graphs.
Discret. Math., 2007
On the restricted connectivity and superconnectivity in graphs with given girth.
Discret. Math., 2007
Connectivity of graphs with given girth pair.
Discret. Math., 2007
New exact values of the maximum size of graphs free of topological complete subgraphs.
Discret. Math., 2007
A sufficient condition for P<sub>k</sub>-path graphs being r-connected.
Discret. Appl. Math., 2007
Edge-connectivity and edge-superconnectivity in sequence graphs.
Discret. Appl. Math., 2007
On the edge-connectivity and restricted edge-connectivity of a product of graphs.
Discret. Appl. Math., 2007
Trees having an even or quasi even degree sequence are graceful.
Appl. Math. Lett., 2007
An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007
2006
All (<i>k</i>;<i>g</i>)-cages are edge-superconnected.
Networks, 2006
Reliability of interconnection networks modeled by a product of graphs.
Networks, 2006
Sufficient conditions for lambda'-optimality in graphs with girth <i>g</i>.
J. Graph Theory, 2006
Extremal K<sub>(s, t)</sub>-free bipartite graphs.
Electron. Notes Discret. Math., 2006
Highly connected star product graphs.
Electron. Notes Discret. Math., 2006
On extremal bipartite graphs with high girth.
Electron. Notes Discret. Math., 2006
On the order of bi-regular cages of even girth.
Electron. Notes Discret. Math., 2006
Consecutive magic graphs.
Discret. Math., 2006
On the degrees of a strongly vertex-magic graph.
Discret. Math., 2006
2005
Connectedness of digraphs and graphs under constraints on the conditional diameter.
Networks, 2005
On restricted connectivities of permutation graphs.
Networks, 2005
Diameter vulnerability of iterated line digraphs in terms of the girth.
Networks, 2005
Sufficient conditions for <i>lambda</i><sup>'</sup>-optimality of graphs with small conditional diameter.
Inf. Process. Lett., 2005
(<i>delta</i>, <i>g</i>)-cages with <i>g</i> geq 10 are 4-connected.
Discret. Math., 2005
Improved lower bound for the vertex connectivity of (<i>delta;</i>;<i>g</i>)-cages.
Discret. Math., 2005
2004
Edge-superconnectivity of cages.
Networks, 2004
Diameter, short paths and superconnectivity in digraphs.
Discret. Math., 2004
Edge-connectivity in <i>P<sub>k</sub></i>-path graphs.
Discret. Math., 2004
2003
Algebraic properties of a digraph and its line digraph.
J. Interconnect. Networks, 2003
Using a progressive withdrawal procedure to study superconnectivity in digraphs.
Discret. Math., 2003
Edge-connectivity and super edge-connectivity of <i>P</i><sub>2</sub>-path graphs.
Discret. Math., 2003
Diameter vulnerability of GC graphs.
Discret. Appl. Math., 2003
2002
Superconnected digraphs and graphs with small conditional diameters.
Networks, 2002
On the superconnectivity of generalized <i>p</i>-cycles.
Discret. Math., 2002
2001
Every Cubic Cage is quasi 4-connected.
Electron. Notes Discret. Math., 2001
Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence.
Electron. Notes Discret. Math., 2001
On the connectivity of generalized p-cycles.
Ars Comb., 2001
On the Connectivity and Superconnectivity of Bipartite Digraphs and Graphs.
Ars Comb., 2001
1999
New large graphs with given degree and diameter six.
Networks, 1999
Superconnectivity of bipartite digraphs and graphs.
Discret. Math., 1999
Extraconnectivity of s-geodetic digraphs and graphs.
Discret. Math., 1999
1997
Extraconnectivity of graphs with large minimum degree and girth.
Discret. Math., 1997
On the order and size of s-geodetic digraphs with given connectivity.
Discret. Math., 1997
Connectivity of large bipartite digraphs and graphs.
Discret. Math., 1997
1996
On the connectivity and the conditional diameter of graphs and digraphs.
Networks, 1996
Distance connectivity in graphs and digraphs.
J. Graph Theory, 1996
1995
Estudio sobre algunas nuevas clases de conectividad condicional en grafos dirigidos.
PhD thesis, 1995
