scholarly journals SPEKTRUM PADA GRAF REGULER KUAT

2013 ◽  
Vol 5 (1) ◽  
pp. 13
Author(s):  
Rizki Mulyani ◽  
Triyani Triyani ◽  
Niken Larasati
Keyword(s):  
Regular Graph ◽  
Adjacency Matrix ◽  
Strongly Regular Graph ◽  
Simple Graph ◽  
Eigen Value ◽  
Strongly Regular

This article studied spectrum of strongly regular graph. This spectrum can be determined by the number of walk with lenght l on connected simple graph, equation of square adjacency matrix and eigen value of strongly regular graph.

scholarly journals More on graphs with just three distinct eigenvalues

2017 ◽  
Vol 11 (1) ◽  
pp. 74-80 ◽  
Author(s):  
Peter Rowlinson
Keyword(s):  
Bipartite Graph ◽  
Regular Graph ◽  
Adjacency Matrix ◽  
Strongly Regular Graph ◽  
Symmetric Design ◽  
Strongly Regular

Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum p,?(k),?(l), where k,l ? N and p > ? > ?. We show that if ? is non-main then ?(G) ? 1 + ? - ??, with equality if and only if G is of one of three types, derived from a strongly regular graph, a symmetric design or a quasi-symmetric design (with appropriate parameters in each case).

scholarly journals Critical group structure from the parameters of a strongly regular graph

2021 ◽  
Vol 180 ◽  
pp. 105424
Author(s):  
Joshua E. Ducey ◽  
David L. Duncan ◽  
Wesley J. Engelbrecht ◽  
Jawahar V. Madan ◽  
Eric Piato ◽  
...  
Keyword(s):  
Regular Graph ◽  
Group Structure ◽  
Strongly Regular Graph ◽  
Critical Group ◽  
Strongly Regular

scholarly journals There Is No Strongly Regular Graph with Parameters (460, 153, 32, 60)

2018 ◽  
pp. 131-134
Author(s):  
Andriy Bondarenko ◽  
Anton Mellit ◽  
Andriy Prymak ◽  
Danylo Radchenko ◽  
Maryna Viazovska
Keyword(s):  
Regular Graph ◽  
Strongly Regular Graph ◽  
Strongly Regular

On Rank 3 Groups Having λ = 0

1977 ◽  
Vol 29 (4) ◽  
pp. 845-847 ◽  
Author(s):  
M. D. Atkinson
Keyword(s):  
Regular Graph ◽  
Strongly Regular Graph ◽  
Permutation Groups ◽  
Constant Number ◽  
Background Theory ◽  
Strongly Regular

In this paper we shall consider certain rank 3 permutation groups G which act on a set Ω of size n. Thus a point stabiliser Gα will have 3 orbits { α }, △ (α), Γ (α) of sizes 1, k, I respectively. It is well known that, if |G| is even, then the orbital △ defines a strongly regular graph on Ω. In this graph, every point has valency k, every pair of adjacent points are adjacent to a constant number λ of common points, and every pair of non-adjacent points are adjacent to a constant number μ of common points. This notation is reasonably standard (see [4], where much background theory is given).

Sign in / Sign up

Export Citation Format

Share Document