Results 41 to 50 of about 491,070 (354)
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 +3 more sources
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 +4 more sources
5-chromatic strongly regular graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fiala, N.C., Haemers, W.H.
openaire +4 more sources
Generalized Krein Parameters of a Strongly Regular Graph [PDF]
, 2007 We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility conditions are deduced.
L. Vieira
semanticscholar +1 more source
Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n
Mathematics, 2019 We construct several new families of directed strongly regular Cayley graphs (DSRCGs) over the metacyclic group M 4 n = 〈 a , b | a n = b 4 = 1 , b − 1 a b = a − 1 〉 , some of which generalize those ...
Tao Cheng, Lihua Feng, Weijun Liu
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
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A. +2 more
core +1 more source
A complete characterization of plateaued Boolean functions in terms of their Cayley graphs [PDF]
, 2018 In this paper we find a complete characterization of plateaued Boolean functions in terms of the associated Cayley graphs. Precisely, we show that a Boolean function $f$ is $s$-plateaued (of weight $=2^{(n+s-2)/2}$) if and only if the associated Cayley ...
A Bernasconi +13 more
core +2 more sources
On the structure of compact graphs [PDF]
Opuscula Mathematica, 2017 A simple graph \(G\) is called a compact graph if \(G\) contains no isolated vertices and for each pair \(x\), \(y\) of non-adjacent vertices of \(G\), there is a vertex \(z\) with \(N(x)\cup N(y)\subseteq N(z)\), where \(N(v)\) is the neighborhood of ...
Reza Nikandish, Farzad Shaveisi
doaj +1 more source
The Strongly Regular $(45,12,3,3)$ Graphs [PDF]
The Electronic Journal of Combinatorics, 2006 Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters $v=45$, $k=12$, $\lambda=\mu=3$. It turns out that there are $78$ such graphs, having automorphism groups with sizes ranging from $1$ to $51840$.
Coolsaet, K., Degraer, J., Spence, E.
openaire +3 more sources