Results 11 to 20 of about 3,086,920 (343)
Shilla distance-regular graphs [PDF]
European Journal of Combinatorics, 2010 14 ...
Jack H. Koolen, Jongyook Park
core +5 more sources
Locally Pseudo-Distance-Regular Graphs [PDF]
Journal of Combinatorial Theory, Series B, 1996 The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph \(\Gamma\) when it is seen from a given vertex.
Miguel Angel Fiol +2 more
openaire +3 more sources
On the distance spectrum of certain distance biregular graphs
The American Journal of Combinatorics, 2023 In this article we present an infinite family of bipartite distance biregular graphs having an arbitrarily large diameter and whose distance matrices have exactly four distinct eigenvalues. This result answers a question posed by F.
Miriam Abdon +2 more
doaj +1 more source
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
Ural Mathematical Journal, 2021 The paper is devoted to the problem of classification of edge-transitive distance-regular antipodal covers of complete graphs. This extends the classification of those covers that are arc-transitive, which has been settled except for some tricky cases ...
Ludmila Yu. Tsiovkina
doaj +1 more source
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
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 +5 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
Leonard pairs, spin models, and distance-regular graphs [PDF]
Journal of Combinatorial Theory, 2019 A Leonard pair is an ordered pair of diagonalizable linear maps on a finite-dimensional vector space, that each act on an eigenbasis for the other one in an irreducible tridiagonal fashion. In the present paper we consider a type of Leonard pair, said to
K. Nomura, Paul M. Terwilliger
semanticscholar +1 more source
The distance spectrum of two new operations of graphs [PDF]
Transactions on Combinatorics, 2020 Let $G$ be a connected graph with vertex set $V(G)=\{v_1, v_2,\ldots,v_n\}$. The distance matrix $D=D(G)$ of $G$ is defined so that its $(i,j)$-entry is equal to the distance $d_G(v_i,v_j)$ between the vertices $v_i$ and $v_j$ of $G$. The eigenvalues
Zikai Tang +3 more
doaj +1 more source