| Optimization of eigenvalue bounds for the independence and chromatic number of graph powers | 0 | 0.34 | 2022 |
| Decompositions Of A Rectangle Into Non-Congruent Rectangles Of Equal Area | 0 | 0.34 | 2021 |
| New Results For The Mondrian Art Problem | 0 | 0.34 | 2021 |
| An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs | 0 | 0.34 | 2020 |
| A new approach to gross error detection for GPS networks | 0 | 0.34 | 2019 |
| An algebraic approach to lifts of digraphs | 0 | 0.34 | 2019 |
| A Note on the Order of Iterated Line Digraphs. | 0 | 0.34 | 2017 |
| Distance mean-regular graphs | 0 | 0.34 | 2017 |
| Abelian Cayley digraphs with asymptotically large order for any given degree | 1 | 0.41 | 2016 |
| Deterministic hierarchical networks | 0 | 0.34 | 2015 |
| Edge-distance-regular graphs are distance-regular | 0 | 0.34 | 2013 |
| The spectral excess theorem for distance-biregular graphs | 0 | 0.34 | 2013 |
| Moments in graphs | 1 | 0.36 | 2013 |
| On almost distance-regular graphs | 10 | 0.86 | 2011 |
| Edge-distance-regular graphs | 1 | 0.36 | 2011 |
| The geometry of t-spreads in k-walk-regular graphs | 0 | 0.34 | 2010 |
| Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes | 1 | 0.37 | 2010 |
| The hierarchical product of graphs | 12 | 1.04 | 2009 |
| Multidimensional Manhattan Street Networks | 1 | 0.39 | 2008 |
| A General Spectral Bound for Distant Vertex Subsets | 0 | 0.34 | 2003 |
| On Moore bipartite digraphs | 1 | 0.41 | 2003 |
| Algebraic characterizations of distance-regular graphs | 18 | 1.56 | 2002 |
| Boundary graphs: the limit case of a spectral property | 11 | 1.13 | 2001 |
| Some Spectral Characterizations of Strongly Distance-Regular Graphs | 3 | 0.57 | 2001 |
| An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs | 6 | 0.63 | 2001 |
| On Twisted Odd Graphs | 0 | 0.34 | 2000 |
| Cayley digraphs form complete generalized cycles | 2 | 0.41 | 1999 |
| Superconnectivity of bipartite digraphs and graphs | 14 | 0.88 | 1999 |
| From regular boundary graphs to antipodal distance-regular graphs | 12 | 1.65 | 1998 |
| Boundary graphs—II: the limit case of a spectral property | 12 | 1.08 | 1998 |
| Triple loop networks with small transmission delay | 10 | 1.03 | 1997 |
| The alternating polynomials and their relation with the spectra and conditional diameters of graphs | 4 | 0.49 | 1997 |
| On the order and size of s-geodetic digraphs with given connectivity | 19 | 1.03 | 1997 |
| Extraconnectivity of graphs with large minimum degree and girth | 11 | 0.66 | 1997 |
| From local adjacency polynomials to locally pseudo-distance-regular graphs | 28 | 2.88 | 1997 |
| Digraphs on permutations | 3 | 0.53 | 1997 |
| Connectivity of large bipartite digraphs and graphs | 6 | 0.63 | 1997 |
| On a class of polynomials and its relation with the spectra and diameters of graphs | 15 | 1.59 | 1996 |
| Locally pseudo-distance-regular graphs | 26 | 2.36 | 1996 |
| Bipartite graphs and digraphs with maximum connectivity | 21 | 1.15 | 1996 |
| Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs" | 2 | 0.39 | 1996 |
| On the extraconnectivity of graphs | 56 | 2.53 | 1996 |
| Distance connectivity in graphs and digraphs | 8 | 0.63 | 1996 |
| Vertex-symmetric digraphs with small diameter | 24 | 2.27 | 1995 |
| An efficient algorithm to find optimal double loop networks | 28 | 1.58 | 1995 |
| On Cayley line digraphs | 2 | 0.51 | 1995 |
| On congruence in Zn and the dimension of a multidimensional circulant | 1 | 0.36 | 1995 |
| The superconnectivity of large digraphs and graphs | 8 | 0.94 | 1994 |
| Extraconnectivity of graphs with large girth | 62 | 3.03 | 1994 |
| On the distance connectivity of graphs and digraphs | 8 | 0.99 | 1994 |
