Results 1 to 10 of about 31,772 (118)
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
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
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
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
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
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