All Stories

  1. A spectral characterization of the s-clique extension of the triangular graphs
  2. Another construction of edge-regular graphs with regular cliques
  3. Distance-regular graphs without 4-claws
  4. On 2-walk-regular graphs with a large intersection number c2
  5. A generalization of a theorem of Hoffman
  6. A new characterization of the dual polar graphs
  7. The polytopal structure of the tight-span of a totally split-decomposable metric
  8. A spectral characterization of the s-clique extension of the square grid graphs
  9. Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs
  10. On graphs with smallest eigenvalue at least −3 and their lattices
  11. A Characterization of the Graphs of Bilinear (d×d)-Forms over $$\mathbb{F}_2$$
  12. On fat Hoffman graphs with smallest eigenvalue at least −3, part II
  13. The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
  14. Edge-regular graphs with regular cliques
  15. Partially metric association schemes with a multiplicity three
  16. A valency bound for distance-regular graphs
  17. Graphs with three eigenvalues and second largest eigenvalue at most 1
  18. Distance-regular graphs of diameter 3 having eigenvalue −1
  19. Max-cut and extendability of matchings in distance-regular graphs
  20. Graphs with two main and two plain eigenvalues
  21. A note on graphs with exactly two main eigenvalues
  22. 2-Walk-regular graphs with a small number of vertices compared to the valency
  23. Preface to the special issue dedicated to Andries E. Brouwer
  24. Corrigendum to “Hypercubes are determined by their distance spectra” [Linear Algebra Appl. 505 (2016) 97–108]
  25. A structure theory for graphs with fixed smallest eigenvalue
  26. Hypercubes are determined by their distance spectra
  27. Biregular graphs with three eigenvalues
  28. A generalization of a theorem of Neumaier
  29. Light tails and the Hermitian dual polar graphs
  30. Equiangular lines in Euclidean spaces
  31. A collection of results concerning electric resistance and simple random walk on distance-regular graphs
  32. Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
  33. Some Results on the Eigenvalues of Distance-Regular Graphs
  34. Optimal realizations of two-dimensional, totally-decomposable metrics
  35. Graphs with many valencies and few eigenvalues
  36. The Terwilliger polynomial of a Q-polynomial distance-regular graph and its application to pseudo-partition graphs
  37. Edge-signed graphs with smallest eigenvalue greater than −2
  38. There are only finitely many distance-regular graphs of fixed valency greater than two
  39. Twice Q-polynomial distance-regular graphs of diameter 4
  40. Regular graphs with maximal energy per vertex
  41. Disconnecting strongly regular graphs
  42. On geometric distance-regular graphs with diameter three
  43. Geometric aspects of 2-walk-regular graphs
  44. There are only finitely many distance-regular graphs with valency k at least three, fixed ratiok2kand large diameter
  45. A note on distance-regular graphs with a small number of vertices compared to the valency
  46. On electric resistances for distance-regular graphs
  47. On the connectedness of the complement of a ball in distance-regular graphs
  48. Injective optimal realizations of finite metric spaces
  49. On a conjecture of Brouwer involving the connectivity of strongly regular graphs
  50. Distance-regular graphs with
  51. The size of 3-compatible, weakly compatible split systems
  52. A relationship between the diameter and the intersection number c 2 for a distance-regular graph
  53. The distance-regular graphs such that all of its second largest local eigenvalues are at most one
  54. The non-bipartite integral graphs with spectral radius three
  55. Core-periphery disparity in fractal behavior of complex networks
  56. An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
  57. Classification of the family
  58. Blocks and Cut Vertices of the Buneman Graph
  59. Shilla distance-regular graphs
  60. On distance-regular graphs with smallest eigenvalue at least −m
  61. An Algorithm for Computing Cutpoints in Finite Metric Spaces
  62. A lower bound for the spectral radius of graphs with fixed diameter
  63. A relation between the Laplacian and signless Laplacian eigenvalues of a graph
  64. Delsarte Set Graphs with Small c 2
  65. Asymptotic results on the spectral radius and the diameter of graphs
  66. Quartets in maximal weakly compatible split systems
  67. Optimal realizations of generic five-point metrics
  68. The spectra of the local graphs of the twisted Grassmann graphs
  69. The vertex-connectivity of a distance-regular graph
  70. A graph-theoretical invariant of topological spaces
  71. Basic Phylogenetic Combinatorics
  72. Block realizations of finite metrics and the tight-span construction I: The embedding theorem
  73. Spectral characterization of the Hamming graphs
  74. Compatible decompositions and block realizations of finite metrics
  75. Characterization of the Patterson graph
  76. On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
  77. Preface
  78. Cut points in metric spaces
  79. GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
  80. Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
  81. Distance-regular graphs with complete multipartite μ-graphs and AT4 family
  82. Combinatorics of lopsided sets
  83. On the structure of the tight-span of a totally split-decomposable metric
  84. Improving diameter bounds for distance-regular graphs
  85. The tight span of an antipodal metric space—Part I:
  86. Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
  87. 4n�?�10
  88. A generalization of an inequality of Brouwer–Wilbrink
  89. A Note on Regular Near Polygons
  90. A Higman-Haemers Inequality for Thick Regular Near Polygons
  91. The Regular Near Polygons of Order (s, 2)
  92. The Tight Span of an Antipodal Metric Space: Part II?Geometrical Properties
  93. There are Finitely Many Triangle-Free Distance-Regular Graphs with Degree 8, 9 or 10
  94. The structure of spherical graphs
  95. A bound for the number of columns ℓ(c,a,b) in the intersection array of a distance-regular graph
  96. Width and dual width of subsets in polynomial association schemes
  97. Addendum to “on line arrangements in the hyperbolic plane” [European J. Combin. 23 (2002) 549–557]
  98. A root graph that is locally the line graph of the Petersen graph
  99. Maximal Energy Bipartite Graphs
  100. On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7
  101. Hyperbolic Bridged Graphs
  102. On Line Arrangements in the Hyperbolic Plane
  103. Six Points Suffice: How to Check for Metric Consistency
  104. Maximal Energy Graphs
  105. Nonexistence of some Antipodal Distance-regular Graphs of Diameter Four
  106. A Classification of the Six-point Prime Metrics
  107. Improving the McClelland inequality for total π-electron energy
  108. Estimating and Approximating the Total π-Electron Energy of Benzenoid Hydrocarbons
  109. The coherency index
  110. The Distance-regular Graphs with Intersection Number and with an Eigenvalue
  111. ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2
  112. A Characterization of the Doob Graphs
  113. On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph
  114. Distance-regular Graphs the Distance Matrix of which has Only One Positive Eigenvalue
  115. On uniformly geodetic graphs
  116. A new condition for distance-regular graphs