Results 11 to 20 of about 115,450 (267)
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Ural Mathematical Journal, 2018 Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
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
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
Ural Mathematical Journal, 2017 Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with \(\lambda=\mu\).
Konstantin S. Efimov +1 more
doaj +1 more source
Tạp chí Khoa học Đại học Đà Lạt, 2013 A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k.
Đỗ Như An, Nguyễn Đình Ái
doaj +1 more source
INDUCED REGULAR PERFECT GRAPHS
South East Asian J. of Mathematics and Mathematical Sciences, 2023 A graph G is said to be R-perfect if, for all induced subgraphs H of G, the induced regular independence number of each induced subgraph H is equal to its corresponding induced regular cover. Here, the induced regular independence number is the maximum number of vertices in H such that no two belong to the same induced regular subgraph in H, and the ...
Jayakumar, Gokul S., V., Sangeetha
openaire +2 more sources
Journal of Combinatorial Theory, Series B, 1997 A covering projection from a graph \(G\) onto a graph \(H\) is a ``local isomorphism'': a mapping from the vertex set of \(G\) onto the vertex set of \(H\) such that, for every \(v\in V(G)\), the neighborhood of \(v\) is mapped bijectively onto the neighborhood (in \(H\)) of the image of \(v\).
Kratochvı́l, Jan +2 more
openaire +1 more source
Ars Mathematica Contemporanea, 2019 20 pages, 6 ...
Potočnik, Primož, Vidali, Janoš
openaire +5 more sources
The Electronic Journal of Combinatorics, 2016 This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin,
Edwin R. van Dam +2 more
openaire +4 more sources
The American Mathematical Monthly, 2011 A graph G=(V,E) is called a unit-distance graph in the plane if there is an injective embedding of V in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree r we talk of a regular matchstick graph.
Kurz, Sascha, Pinchasi, Rom
openaire +2 more sources
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
Discussiones Mathematicae Graph Theory, 2022 A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source