Results 21 to 30 of about 2,911,408 (294)
The application domain of difference type matrix D(r,0,s,0,t) on some sequence spaces [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 two ...
Paul Avinoy, Tripathy Binod Chandra
doaj +1 more source
Complex Hadamard graphs and Butson matrices
AKCE International Journal of Graphs and Combinatorics, 2023 This article introduces complex Hadamard graphs and studies their properties. Using the complete subgraphs of these complex Hadamard graphs, complex Hadamard matrices of order n are generated, where n is a multiple of four.
Briji Jacob Chathely, Rajendra P. Deore
doaj +1 more source
Extension of Strongly Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 The Friendship Theorem states that if any two people in a party have exactly one common friend, then there exists a politician who is a friend of everybody. In this paper, we generalize the Friendship Theorem. Let $\lambda$ be any nonnegative integer and $\mu$ be any positive integer.
Gera, Ralucca, Shen, J.
openaire +5 more sources
, 2017 Tema diplomskog rada su jako regularni grafovi. Kako bismo bolje razumijeli sve pojmove diplomski rad podijeljen je na dva dijela. U prvom dijelu koji nam je potreban za lakim razumijevanjem jako regularnih grafova prvo se upoznajemo s teorijom grafova ...
Lukić, Petra
core +3 more sources
On the Integrability of Strongly Regular Graphs [PDF]
Graphs and Combinatorics, 2019 Koolen et al. showed that if a connected graph with smallest eigenvalue at least $-3$ has large minimal valency, then it is $2$-integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.
Jack H. Koolen +2 more
openaire +3 more sources
D-magic strongly regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +1 more source
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
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
Linear codes and cyclic codes over finite rings and their generalizations: a survey
Electronic Journal of Graph Theory and Applications, 2023 We survey a recent progress of cyclic codes over finite rings and their generalization to skew cyclic as well as skew cyclic codes with derivation over finite rings, focusing on structural properties of the codes.
Djoko Suprijanto
doaj +1 more source
Journal of Algebraic SystemsRecently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix.
Valentino Smaldore
doaj +1 more source