Results 11 to 20 of about 2,221,542 (211)
Laplacian spectra of regular graph transformations [PDF]
Discrete Applied Mathematics, 2017 Given a graph G with vertex set V(G)=V and edge set E(G)=E, let G^l be the line graph and G^c the complement of G. Let G^0 be the graph with V(G^0)=V and with no edges, G^1 the complete graph with the vertex set V, G^+=G and G^-=G^c. Let B(G) (B^c(G)) be
Aiping Deng, A. Kelmans, J. Meng
semanticscholar +1 more source
Regular colorings in regular graphs
Discussiones Mathematicae Graph Theory, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anton Bernshteyn +6 more
openaire +3 more sources
There is no (95, 40, 12, 20) strongly regular graph [PDF]
Journal of combinatorial designs (Print), 2016 We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2).
Jernej Azarija, Tilen Marc
semanticscholar +1 more source
The Terwilliger algebra of an almost-bipartite distance-regular graph and its antipodal 2-cover
Discrete Mathematics, 2000 B. Collins
exaly +2 more sources
Non-ergodic delocalized phase in Anderson model on Bethe lattice and regular graph [PDF]
, 2017 We develop a novel analytical approach to the problem of single particle localization in infinite dimensional spaces such as Bethe lattice and random regular graph models.
V.E.Kravtsov, B.L.Altshuler, L.B.Ioffe
semanticscholar +1 more source
There is no (75,32,10,16) strongly regular graph [PDF]
Linear Algebra and its Applications, 2015 We show that there is no (75,32,10,16) strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough induced structure and apply the star complement technique. Our result implies
Jernej Azarija, Tilen Marc
semanticscholar +1 more source
DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST
Ural Mathematical Journal, 2020 In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;1,3 ...
Konstantin S. Efimov +1 more
doaj +1 more source
The transition matroid of a 4-regular graph: An introduction [PDF]
European journal of combinatorics (Print), 2013 Given a 4-regular graph F , we introduce a binary matroid M ? ( F ) on the set of transitions of F . Parametrized versions of the Tutte polynomial of M ?
L. Traldi
semanticscholar +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
Degrees in Link Graphs of Regular Graphs
The Electronic Journal of Combinatorics, 2022 We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of $G$ has minimum degree at most $\lfloor{2d/3}\rfloor-1$, and if $G$ is sufficiently large in terms of $d$ then some ...
Benjamini, I, Haslegrave, J
openaire +3 more sources