Results 11 to 20 of about 2,911,408 (294)
Spreads in Strongly Regular Graphs [PDF]
Designs, Codes and Cryptography, 1996 A spread in any geometry is a set of pairwise disjoint lines that cover all the points. For a partial geometry the point graph (collinearity graph) is strongly regular. Delsarte showed that a clique in a strongly regular graph has at most \(K = 1 - k/s\) vertices, where \(k\) and \(s\) are the largest and smallest eigenvalues of the graph respectively.
Willem H. Haemers, Vladimir D. Tonchev
core +7 more sources
Discrete Mathematics, 1975 Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
Xavier L. Hubaut, Hubaut, Xavier
core +7 more sources
Cyclotomy and Strongly Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E. +2 more
openaire +4 more sources
Shannon Capacity and Related Graph Invariants for Lexicographic Products [PDF]
EntropyThis paper studies the Shannon capacity of lexicographic products of finite simple graphs, together with the Lovász theta function and the fractional Haemers number. The Shannon capacity is proved to be supermultiplicative under lexicographic products in
Igal Sason
doaj +2 more sources
Prodeg type Shannon graph entropies with closed forms bounds and QSPR modeling [PDF]
Scientific ReportsDegree-based graph entropies quantify structural heterogeneity by transforming vertex-degree information into a probability distribution and applying Shannon entropy.
Mohammed Alsharafi, Yusuf Zeren
doaj +2 more sources
, 2022 Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will ...
Andries E. Brouwer, H. Van Maldeghem
openaire +2 more sources
, 2001 In this chapter we return to the theme of combinatorial regularity with the study of strongly regular graphs. In addition to being regular, a strongly regular graph has the property that the number of common neighbours of two distinct vertices depends only on whether they are adjacent or nonadjacent.
Chris Godsil, Gordon Royle
openaire +2 more sources
Applications of Strongly Regular Cayley Graphs to Codebooks
IEEE Access, 2023 In this paper, we give a construction of strongly regular Cayley graphs on the finite field $\mathbb {F}_{q^{n}}$ . As applications of these strongly regular Cayley graphs, a class of codebooks is presented and proved to be asymptotically optimal with ...
Qiuyan Wang +3 more
doaj +1 more source
An upper bound for difference of energies of a graph and its complement
Examples and Counterexamples, 2023 The A-energy of a graph G, denoted by EA(G), is defined as sum of the absolute values of eigenvalues of adjacency matrix of G. Nikiforov in Nikiforov (2016) proved that EA(G¯)−EA(G)≤2μ¯1and EA(G)−EA(G¯)≤2μ1for any graph G and posed a problem to find best
Harishchandra S. Ramane +2 more
doaj +1 more source
On strongly regular graphs with m2 = qm3 and m3 = qm2 for q = 7/2, 7/3, 7/4, 7/5, 7/6 [PDF]
Yugoslav Journal of Operations Research, 2021 We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is strongly regular if there exist non-negative integers τ and θ such that |Si ∩ Sj| = τ for any two adjacent vertices i and j, and |Si ∩ Sj| = θ for any
Lepović Mirko
doaj +1 more source