2025
Some bounds on the Laplacian eigenvalues of token graphs.
Discret. Math., 2025
On the algebraic connectivity of token graphs and graphs under perturbations.
Discret. Appl. Math., 2025
2024
Structural and Spectral Properties of Chordal Ring, Multi-Ring, and Mixed Graphs.
Symmetry, September, 2024
On large regular (1,1,k)-mixed graphs.
Discret. Appl. Math., 2024
Integer Sequences from k-iterated Line Digraphs.
Proceedings of the 24th Conference Information Technologies, 2024
2023
Discovering Important Nodes of Complex Networks Based on Laplacian Spectra.
IEEE Trans. Circuits Syst. I Regul. Pap., October, 2023
On inertia and ratio type bounds for the k-independence number of a graph and their relationship.
Discret. Appl. Math., July, 2023
Moore mixed graphs from Cayley graphs.
Electron. J. Graph Theory Appl., 2023
On the Spectra and Spectral Radii of Token Graphs.
Proceedings of the 23rd Conference Information Technologies, 2023
2022
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers.
Discret. Math., 2022
2021
Electron. J. Graph Theory Appl., 2021
Decompositions of a rectangle into non-congruent rectangles of equal area.
Discret. Math., 2021
Bipartite biregular Moore graphs.
Discret. Math., 2021
New results for the Mondrian art problem.
Discret. Appl. Math., 2021
2020
On a version of the spectral excess theorem.
Electron. J. Graph Theory Appl., 2020
An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs.
Discret. Math., 2020
2019
A Note on a New General Family of Deterministic Hierarchical Networks.
J. Interconnect. Networks, 2019
On the k-independence number of graphs.
Discret. Math., 2019
An algebraic approach to lifts of digraphs.
Discret. Appl. Math., 2019
A new approach to gross error detection for GPS networks.
Discret. Appl. Math., 2019
El mètode de les línies per a la resolució numèrica d'equacions en derivades parcials. The method of lines for numerical solutions of partial differential equations.
CoRR, 2019
2018
On bipartite-mixed graphs.
J. Graph Theory, 2018
Graphs, friends and acquaintances.
Electron. J. Graph Theory Appl., 2018
An improved upper bound for the order of mixed graphs.
Discret. Math., 2018
Measures of Edge-Uncolorability of Cubic Graphs.
Electron. J. Comb., 2018
2017
A Note on the Order of Iterated Line Digraphs.
J. Graph Theory, 2017
Distance mean-regular graphs.
Des. Codes Cryptogr., 2017
Discret. Appl. Math., 2017
2016
Some spectral and quasi-spectral characterizations of distance-regular graphs.
J. Comb. Theory A, 2016
A geometric approach to dense Cayley digraphs of finite Abelian groups.
Electron. Notes Discret. Math., 2016
Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree.
Electron. J. Comb., 2016
2015
The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues.
Electron. Notes Discret. Math., 2015
Electron. J. Graph Theory Appl., 2015
Deterministic hierarchical networks.
CoRR, 2015
Some Results on the Structure of Multipoles in the Study of Snarks.
Electron. J. Comb., 2015
2014
The (Delta, D) and (Delta, N) problems in double-step digraphs with unilateral distance.
Electron. J. Graph Theory Appl., 2014
Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231].
Eur. J. Comb., 2014
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes.
Discret. Appl. Math., 2014
2013
Comments on "Extremal Cayley Digraphs of Finite Abelian Groups" [Intercon. Networks 12 (2011), numbers 1-2, 125-135].
J. Interconnect. Networks, 2013
On some approaches to the spectral excess theorem for nonregular graphs.
J. Comb. Theory A, 2013
Edge-distance-regular graphs are distance-regular.
J. Comb. Theory A, 2013
ID Routing Mechanism for Opportunistic Multi-Hop Networks.
IEEE Commun. Lett., 2013
The Manhattan product of digraphs.
Electron. J. Graph Theory Appl., 2013
Algebraic characterizations of regularity properties in bipartite graphs.
Eur. J. Comb., 2013
Discret. Appl. Math., 2013
The Spectral Excess Theorem for Distance-Biregular Graphs.
Electron. J. Comb., 2013
2012
Dual concepts of almost distance-regularity and the spectral excess theorem.
Discret. Math., 2012
The (Δ,D) and (Δ,N) problems for New Amsterdam and Manhattan digraphs
CoRR, 2012
A simple and fast heuristic algorithm for edge-coloring of graphs
CoRR, 2012
A Short Proof of the Odd-Girth Theorem.
Electron. J. Comb., 2012
2011
Performance analysis of the Sent-But-Sure strategy for Optical Burst and Packet Switched Networks.
Perform. Evaluation, 2011
On almost distance-regular graphs.
J. Comb. Theory A, 2011
Edge-distance-regular graphs.
J. Comb. Theory A, 2011
A Differential Approach for Bounding the Index of Graphs under Perturbations.
Electron. J. Comb., 2011
2010
The geometry of <i>t</i>-spreads in <i>k</i>-walk-regular graphs.
J. Graph Theory, 2010
The local spectra of regular line graphs.
Discret. Math., 2010
Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes.
Electron. J. Comb., 2010
2009
A Routing and Wavelength Assignment Strategy for Successful Transmission in Optical Networks.
J. Interconnect. Networks, 2009
Load-balanced wavelength assignment strategies for optical burst/packet switching networks.
IET Commun., 2009
On t-Cliques in k-Walk-Regular Graphs.
Electron. Notes Discret. Math., 2009
Number of walks and degree powers in a graph.
Discret. Math., 2009
The generalized hierarchical product of graphs.
Discret. Math., 2009
The hierarchical product of graphs.
Discret. Appl. Math., 2009
On k-Walk-Regular Graphs.
Electron. J. Comb., 2009
Some Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes.
Electron. J. Comb., 2009
2008
Multidimensional Manhattan Street Networks.
SIAM J. Discret. Math., 2008
A general resource assignment scheme for successful transmission in optical burst switched networks.
Opt. Switch. Netw., 2008
2007
The Local Spectra of Line Graphs.
Electron. Notes Discret. Math., 2007
Spectral and Geometric Properties of k-Walk-Regular Graphs.
Electron. Notes Discret. Math., 2007
The Multidimensional Manhattan Network.
Electron. Notes Discret. Math., 2007
A Spectral Study of the Manhattan Networks.
Electron. Notes Discret. Math., 2007
On the fairness issue in OBS loss-free schemes.
Proceedings of the Fourth International Conference on Broadband Communications, 2007
2006
On the spectrum of an extremal graph with four eigenvalues.
Discret. Math., 2006
Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings.
Proceedings of the 3rd International Conference on Broadband Communications, 2006
A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks.
Proceedings of the 3rd International Conference on Broadband Communications, 2006
2004
Weakly distance-regular digraphs.
J. Comb. Theory B, 2004
2003
The spectra of wrapped butterfly digraphs.
Networks, 2003
On Moore bipartite digraphs.
J. Graph Theory, 2003
Chromatic Automorphisms of Consecutive Digraphs.
Graphs Comb., 2003
A General Spectral Bound For Distant Vertex Subsets.
Comb. Probab. Comput., 2003
Connectivity and Traversability.
Proceedings of the Handbook of Graph Theory., 2003
2002
Algebraic characterizations of distance-regular graphs.
Discret. Math., 2002
2001
An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs.
SIAM J. Discret. Math., 2001
On the Spectrum of a Weakly Distance-Regular Digraph.
Electron. Notes Discret. Math., 2001
Boundary graphs: The limit case of a spectral property.
Discret. Math., 2001
Some Spectral Characterizations Of Strongly Distance-Regular Graphs.
Comb. Probab. Comput., 2001
2000
Periodic Tilings as a Dissection Method.
Am. Math. Mon., 2000
Comb. Probab. Comput., 2000
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs.
Electron. J. Comb., 2000
1999
Cayley Digraphs from Complete Generalized Cycles.
Eur. J. Comb., 1999
Superconnectivity of bipartite digraphs and graphs.
Discret. Math., 1999
1998
From regular boundary graphs to antipodal distance-regular graphs.
J. Graph Theory, 1998
Boundary graphs - II The limit case of a spectral property.
Discret. Math., 1998
The Alternating and Adjacency Polynomials, and Their Relation with the Spectra and Diameters of Graphs.
Discret. Appl. Math., 1998
1997
From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs.
J. Comb. Theory B, 1997
The alternating polynomials and their relation with the spectra and conditional diameters of graphs.
Discret. Math., 1997
Digraphs on permutations.
Discret. Math., 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
Triple loop networks with small transmission delay.
Discret. Math., 1997
An Eigenvalue Characterization of Antipodal Distance Regular Graphs.
Electron. J. Comb., 1997
Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra.
Electron. J. Comb., 1997
1996
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs".
IEEE Trans. Computers, 1996
On the connectivity and the conditional diameter of graphs and digraphs.
Networks, 1996
Distance connectivity in graphs and digraphs.
J. Graph Theory, 1996
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs.
J. Comb. Theory B, 1996
Locally Pseudo-Distance-Regular Graphs.
J. Comb. Theory, Ser. B, 1996
On the extraconnectivity of graphs.
Discret. Math., 1996
Bipartite Graphs and Digraphs with Maximum Connectivity.
Discret. Appl. Math., 1996
1995
On congruence in Z<sup>n</sup> and the dimension of a multidimensional circulant.
Discret. Math., 1995
An efficient algorithm to find optimal double loop networks.
Discret. Math., 1995
Vertex-symmetric Digraphs with Small Diameter.
Discret. Appl. Math., 1995
1994
On Large Vertex Symmetric 2-Reachable Digraphs.
Parallel Process. Lett., 1994
On the distance connectivity of graphs and digraphs.
Discret. Math., 1994
The superconnectivity of large digraphs and graphs.
Discret. Math., 1994
Extraconnectivity of graphs with large girth.
Discret. Math., 1994
1993
A Unified Approach to the design and Control of Dynamic Memory Networks.
Parallel Process. Lett., 1993
The connectivity of large digraphs and graphs.
J. Graph Theory, 1993
On large (Delta, D)-graphs.
Discret. Math., 1993
Double commutative-step digraphs with minimum diameters.
Discret. Math., 1993
1992
The Partial Line Digraph Technique in the Design of Large Interconnection Networks.
IEEE Trans. Computers, 1992
On super-edge-connected digraphs and bipartite digraphs.
J. Graph Theory, 1992
Graphs on Alphabets as Models for Large Interconnection Networks.
Discret. Appl. Math., 1992
1990
Dense bipartite digraphs.
J. Graph Theory, 1990
1989
Maximally connected digraphs.
J. Graph Theory, 1989
1987
A Discrete Optimization Problem in Local Networks and Data Alignment.
IEEE Trans. Computers, 1987
Congruences in Z<sup>n</sup>, finite Abelian groups and the Chinese remainder theorem.
Discret. Math., 1987
On the (d, D, D, s) - Digraph Problem.
Proceedings of the Applied Algebra, 1987
An Algebraic Model for the Storage of Data in Parallel Memories.
Proceedings of the Applied Algebra, 1987
1986
Some large graphs with given degree and diameter.
J. Graph Theory, 1986
1984
Line Digraph Iterations and the (<i>d, k</i>) Digraph Problem.
IEEE Trans. Computers, 1984
1983
Reduction of Connections for Multibus Organization.
IEEE Trans. Computers, 1983
Line Digraph Iterations and the (d,k) Problem for Directed Graphs
Proceedings of the 10th Annual Symposium on Computer Architecture, 1983, 1983
