Results 41 to 50 of about 2,911,408 (294)
A unique and novel graph matrix for efficient extraction of structural information of networks
Electronic Journal of Graph Theory and Applications, 2021 In this article, we propose a new type of square matrix associated with an undirected graph by trading off the natural embedded symmetry in them. The proposed matrix is defined using the neighbourhood sets of the vertices, called as neighbourhood matrix
Sivakumar Karunakaran +1 more
doaj +1 more source
Generation of strongly regular graphs from quaternary complex Hadamard matrices
Ceylon Journal of Science, 2018 A strongly regular graph with parameters (v, k, μ, λ) is a regular graph G with v vertices and k degree in which every two adjacent vertices have λ common neighbors and every two non-adjacent vertices have μ common neighbors. In this paper, we propose an
W. V. Nishadi +3 more
doaj +1 more source
Strongly Regular Graphs Having Strongly Regular Subconstituents
Journal of Algebra, 1978 No abstract.
Cameron, P.J. +2 more
openaire +2 more sources
Euclidean Jordan algebras and some conditions over the spectra of a strongly regular graph
4 open, 2019 Let G be a primitive strongly regular graph G such that the regularity is less than half of the order of G and A its matrix of adjacency, and let 𝒜 be the real Euclidean Jordan algebra of real symmetric matrices of order n spanned by the identity matrix ...
Vieira Luís
doaj +1 more source
Vulnerability Parameters in Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2022 Let 𝐺 = (U, V) be a Single valued Neutrosophic graph. A subset 𝑆 ∈ 𝑈(𝐺) is a said to be score equitable set if the score value of any two nodes in S differ by at most one. That is, |𝑠(𝑢)– 𝑠(𝑣)| ≤ 1, 𝑢, 𝑣 ∊ 𝑆. If e is an edge with end vertices u and v and
R.V. Jaikumar +4 more
doaj +1 more source
The Extendability of Matchings in Strongly Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 A graph $G$ of even order $v$ is called $t$-extendable if it contains a perfect matching, $t<v/2$ and any matching of $t$ edges is contained in some perfect matching. The extendability of $G$ is the maximum $t$ such that $G$ is $t$-extendable. In this paper, we study the extendability properties of strongly regular graphs.
Sebastian M. Cioaba, Weiqiang Li 0002
openaire +2 more sources
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
Journal of Combinatorial Theory, Series A, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rudolf Mathon, Alexander Rosa
openaire +3 more sources
Linear Codes from Two Weakly Regular Plateaued Balanced Functions
Entropy, 2023 Linear codes with a few weights have been extensively studied due to their wide applications in secret sharing schemes, strongly regular graphs, association schemes, and authentication codes.
Shudi Yang, Tonghui Zhang, Ping Li
doaj +1 more source
On the Clique Number of a Strongly Regular Graph [PDF]
The Electronic Journal of Combinatorics, 2018 We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
Gary R. W. Greaves, Leonard H. Soicher
openaire +4 more sources