Results 11 to 20 of about 28,901 (265)
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
Certain Concepts in Vague Graph with an Application
Discrete Dynamics in Nature and Society, 2022 Vague graphs (VGs), belonging to the FGs family, have good capabilities when faced with problems that cannot be expressed by FGs. When an element’s membership is not clear, neutrality is a good option that can be well-supported by a VG.
Xiaolong Shi +3 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
Graph isomorphism and Gaussian boson sampling
Special Matrices, 2021 We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
Brádler Kamil +4 more
doaj +1 more source
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products
Entropy, 2023 This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs.
Igal Sason
doaj +1 more source
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
Maximal Product of Graphs under Vague Environment
Mathematical and Computational Applications, 2020 Graph models are found everywhere in natural and human made structures, including process dynamics in physical, biological and social systems. The product of graphs are appropriately used in several combinatorial applications and in the formation of ...
Behnaz Sheikh Hoseini +4 more
doaj +1 more source
Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$, $q leq 23$ [PDF]
International Journal of Group Theory, 2019 In this paper we construct transitive $t$-designs from the linear groups $L(2,q), q leq 23$. Thereby we classify $t$-designs, $t ge 2$, admitting a transitive action of the linear groups $L(2,q), q leq 23$, up to 35 points and obtained ...
Dean Crnković, Andrea Švob
doaj +1 more source
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
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