Results 1 to 10 of about 542,793 (319)
On Almost Distance-Regular Graphs [PDF]
Journal of Combinatorial Theory, Series A, 2011 2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Dalfo, C. +4 more
core +11 more sources
Distance-regular subgraphs in a distance-regular graph, II
European Journal of Combinatorics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akira Hiraki
semanticscholar +5 more sources
The least Euclidean distortion constant of a distance-regular graph [PDF]
Discrete Applied Mathematics, 2021 In 2008, Vallentin made a conjecture involving the least distortion of an embedding of a distance-regular graph into Euclidean space. Vallentin’s conjecture implies that for a least distortion Euclidean embedding of a distance-regular graph of diameter d,
Sebastian M. Cioabùa +3 more
semanticscholar +1 more source
The Norton algebra of a Q-polynomial distance-regular graph [PDF]
Journal of Combinatorial Theory, 2020 We consider the Norton algebra associated with a $Q$-polynomial primitive idempotent of the adjacency matrix for a distance-regular graph. We obtain a formula for the Norton algebra product that we find attractive.
Paul M. Terwilliger
semanticscholar +1 more source
Edge-distance-regular graphs [PDF]
Journal of Combinatorial Theory, Series A, 2011 Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph Γ with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same ...
Cámara Vallejo, Marc +4 more
openaire +6 more sources
ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE \(\theta=1\)
Ural Mathematical Journal, 2022 For a distance-regular graph \(\Gamma\) of diameter 3, the graph \(\Gamma_i\) can be strongly regular for \(i=2\) or 3. J.Kulen and co-authors found the parameters of a strongly regular graph \(\Gamma_2\) given the intersection array of the graph ...
Alexander A. Makhnev +2 more
doaj +1 more source
Al-Rafidain Journal of Computer Sciences and Mathematics, 2023 The new distance defined on a connected graph G contains of three terms: The ordinary distance between any two vertices in G, both the sum and the product of the two vertices' degrees, as this distance is more useful than the ordinary distance ...
Asmaa Aziz
doaj +1 more source
Two distance-regular graphs [PDF]
Journal of Algebraic Combinatorics, 2011 We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B_3(q) induced on the vertices far from a fixed point, and the subgraph of the dual polar graph of type D_4(q) induced on the vertices far from a fixed edge. The latter is the extended bipartite double of the former.
Brouwer, Andries E. +1 more
openaire +5 more sources
Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$ [PDF]
Transactions on Combinatorics, 2020 In this paper we classify distance-regular graphs, including strongly regular graphs, admitting a transitive action of the linear groups $L(3,2)$, $L(3,3)$, $L(3,4)$ and $L(3,5)$ for which the rank of the permutation representation is at most 15.
Andrea Svob
doaj +1 more source
A new distance-regular graph of diameter 3 on 1024 vertices [PDF]
Designs, Codes and Cryptography, 2018 The dodecacode is a nonlinear additive quaternary code of length 12. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance 5.
Minjia Shi, D. Krotov, P. Solé
semanticscholar +1 more source