Results 11 to 20 of about 2,798,542 (296)

Strongly regular graphs [PDF]

Discrete Mathematics, 1975
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal and combinatorial aspects of the theory have been included. We give the list of all known strongly regular graphs and a large bibliography of this subject.
Hubaut, Xavier L., Xavier L. Hubaut, Hubaut, Xavier   +2 more
core   +7 more sources

Spreads in strongly regular graphs [PDF]

Designs, Codes and Cryptography, 1995
A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called Hoffman's bound). Such spreads give rise to colorings meeting Hoffman's lower bound for the chromatic number and to ...
Touchev, V.D., Haemers, W.H.; id_orcid, Tonchev, V.D., Tonchev, Vladimir, Haemers, W.H., Haemers, WH Willem, Tonchev, VD Vladimir, Willem H. Haemers, Vladimir D. Tonchev, Haemers, Willem   +9 more
core   +4 more sources

Strongly regular graphs

, 2022
Strongly regular graphs are certain very regular structures found in statistical design, finite group theory, coding theory and quantum information theory. This monograph gives a detailed survey of theory and examples.
Van Maldeghem, Hendrik, Brouwer, Andries E.   +1 more
core   +2 more sources

Strongly Regular Graphs [PDF]

, 2001
Strongly regular grahphs and directed strongly regular graphs are introduced. Examples of strongly regular graphs are give: Conference graph and latin square graphs. The existence of a directed strongly regular graph with t=0.
Thomsen, Jakob Peter
core   +2 more sources

Strongly regular graphs

, 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   +4 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   +5 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, Masood Ur Rehman 0001, Qianqian Yang 0006   +2 more
openaire   +3 more sources

Cyclotomy and Strongly Regular Graphs [PDF]

Journal of Algebraic Combinatorics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E., Wilson, R. M., Xiang, Qing   +2 more
openaire   +3 more sources

RAMANUJAN POLAR GRAPHS [PDF]

Journal of Algebraic Systems
Recently, 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

The Connectivity of Strongly Regular Graphs

European Journal of Combinatorics, 1985
Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.
A.E. Brouwer (Andries), D.M. Mesner
openaire   +4 more sources