edge regular graphs and regular cliques
play

Edge-regular graphs and regular cliques Gary Greaves Nanyang - PowerPoint PPT Presentation

Oct 04, 2022 •176 likes •787 views

Edge-regular graphs and regular cliques Gary Greaves Nanyang Technological University, Singapore 23rd May 2018 joint work with J. H. Koolen Gary Greaves Edge-regular graphs and regular cliques 1/13 Gary Greaves Edge-regular graphs and

  1. Edge-regular graphs and regular cliques Gary Greaves Nanyang Technological University, Singapore 23rd May 2018 joint work with J. H. Koolen Gary Greaves — Edge-regular graphs and regular cliques 1/13

  2. Gary Greaves — Edge-regular graphs and regular cliques 2/13

  3. k Gary Greaves — Edge-regular graphs and regular cliques 2/13

  4. k Gary Greaves — Edge-regular graphs and regular cliques 2/13

  5. k Gary Greaves — Edge-regular graphs and regular cliques 2/13

  6. k Gary Greaves — Edge-regular graphs and regular cliques 2/13

  7. k Gary Greaves — Edge-regular graphs and regular cliques 2/13

  8. k k = 6 Gary Greaves — Edge-regular graphs and regular cliques 2/13

  9. k k = 6 λ Gary Greaves — Edge-regular graphs and regular cliques 2/13

  10. k k = 6 λ Gary Greaves — Edge-regular graphs and regular cliques 2/13

  11. k k = 6 λ Gary Greaves — Edge-regular graphs and regular cliques 2/13

  12. k k = 6 λ Gary Greaves — Edge-regular graphs and regular cliques 2/13

  13. k k = 6 λ Gary Greaves — Edge-regular graphs and regular cliques 2/13

  14. k k = 6 λ λ = 3 Gary Greaves — Edge-regular graphs and regular cliques 2/13

  15. k k = 6 λ λ = 3 edge-regular erg ( 10, 6, 3 ) Gary Greaves — Edge-regular graphs and regular cliques 2/13

  16. 6 3 edge-regular erg ( 10, 6, 3 ) Gary Greaves — Edge-regular graphs and regular cliques 3/13

  17. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  18. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  19. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  20. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  21. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  22. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  23. 6 3 edge-regular erg ( 10, 6, 3 ) clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  24. 6 3 edge-regular erg ( 10, 6, 3 ) 2 - regular clique of order 4 Gary Greaves — Edge-regular graphs and regular cliques 3/13

  25. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. Gary Greaves — Edge-regular graphs and regular cliques 4/13

  26. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. Gary Greaves — Edge-regular graphs and regular cliques 4/13

  27. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 Gary Greaves — Edge-regular graphs and regular cliques 4/13

  28. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ Gary Greaves — Edge-regular graphs and regular cliques 4/13

  29. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ Gary Greaves — Edge-regular graphs and regular cliques 4/13

  30. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ Gary Greaves — Edge-regular graphs and regular cliques 4/13

  31. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ Gary Greaves — Edge-regular graphs and regular cliques 4/13

  32. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ Gary Greaves — Edge-regular graphs and regular cliques 4/13

  33. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ µ = 4 Gary Greaves — Edge-regular graphs and regular cliques 4/13

  34. Theorem (Neumaier 1981) Let Γ be edge-regular with a regular clique. Suppose Γ is vertex-transitive and edge-transitive. Then Γ is strongly regular. 6 3 µ µ = 4 strongly regular srg ( 10, 6, 3, 4 ) Gary Greaves — Edge-regular graphs and regular cliques 4/13

  35. Question (Neumaier 1981) Is every edge-regular graph with a regular clique strongly regular? Gary Greaves — Edge-regular graphs and regular cliques 5/13

  36. Question (Neumaier 1981) Is every edge-regular graph with a regular clique strongly regular? Answer (GG and Koolen 2018) No. Gary Greaves — Edge-regular graphs and regular cliques 5/13

  37. Question (Neumaier 1981) Is every edge-regular graph with a regular clique strongly regular? Answer (GG and Koolen 2018) No. There exist infinitely many non-strongly-regular, edge-regular vertex-transitive graphs with regular cliques. Gary Greaves — Edge-regular graphs and regular cliques 5/13

  38. An example Gary Greaves — Edge-regular graphs and regular cliques 6/13

  39. Cayley graphs ◮ Let G be an (additive) group and S ⊆ G a (symmetric) generating subset, i.e., s ∈ S = ⇒ − s ∈ S and G = � S � . ◮ The Cayley graph Cay ( G , S ) has vertex set G and edge set {{ g , g + s } : g ∈ G and s ∈ S } . Example Γ = Cay ( Z 5 , S ) Generating set S = {− 1, 1 } 1 0 2 − 1 − 2 Gary Greaves — Edge-regular graphs and regular cliques 7/13

  40. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ( 11, 0 ) ( 11, ± 3 ) Gary Greaves — Edge-regular graphs and regular cliques 8/13

  41. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) : ( 11, 0 ) ( 11, ± 3 ) Gary Greaves — Edge-regular graphs and regular cliques 8/13

  42. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) : ( 11, 0 ) ( 11, ± 3 ) ( 00, 0 ) Gary Greaves — Edge-regular graphs and regular cliques 8/13

  43. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) : ( 11, 0 ) ( 11, ± 3 ) ( 10, 0 ) ( 01, 0 ) ( 11, 0 ) ( 00, 0 ) ( 11, 3 ) ( 01, 1 ) ( 10, 2 ) ( 10, − 2 ) ( 01, − 1 ) ( 11, − 3 ) Gary Greaves — Edge-regular graphs and regular cliques 8/13

  44. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) : ( 11, 0 ) ( 11, ± 3 ) ( 10, 0 ) ( 01, 0 ) ( 11, 0 ) ( 00, 0 ) ( 11, 3 ) ( 01, 1 ) ( 10, 2 ) ( 10, − 2 ) ( 01, − 1 ) ( 11, − 3 ) Gary Greaves — Edge-regular graphs and regular cliques 8/13

  45. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) ; ( 11, 0 ) ( 11, ± 3 ) ◮ Γ has a 1 -regular 4 -clique : Gary Greaves — Edge-regular graphs and regular cliques 9/13

  46. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) ; ( 11, 0 ) ( 11, ± 3 ) ◮ Γ has a 1 -regular 4 -clique : ( 01, 0 ) ( 00, 0 ) ( 10, 0 ) ( 11, 0 ) Gary Greaves — Edge-regular graphs and regular cliques 9/13

  47. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) ; ( 11, 0 ) ( 11, ± 3 ) ◮ Γ has a 1 -regular 4 -clique : ( 01, 0 ) ( 00, 0 ) ( 10, 0 ) ( a , b ) b � = 0 ( 11, 0 ) Gary Greaves — Edge-regular graphs and regular cliques 9/13

  48. An example Generating set S ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 01, 0 ) ( 01, ± 1 ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) ; ( 11, 0 ) ( 11, ± 3 ) ◮ Γ has a 1 -regular 4 -clique : ( 01, 0 ) ( ∗ , − b ) ( 00, 0 ) ( 10, 0 ) ( a , b ) b � = 0 ( 11, 0 ) Gary Greaves — Edge-regular graphs and regular cliques 9/13

  49. An example Generating set S ( 01, 0 ) ( 01, ± 1 ) ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) ; ( 11, 0 ) ( 11, ± 3 ) ◮ Γ has a 1 -regular 4 -clique; ◮ Γ is not strongly regular : Gary Greaves — Edge-regular graphs and regular cliques 10/13

  50. An example Generating set S ( 01, 0 ) ( 01, ± 1 ) ◮ Γ = Cay ( Z 2 2 ⊕ Z 7 , S ) ( 10, 0 ) ( 10, ± 2 ) ◮ Γ is edge-regular ( 28, 9, 2 ) ; ( 11, 0 ) ( 11, ± 3 ) ◮ Γ has a 1 -regular 4 -clique; ◮ Γ is not strongly regular : ( 11, 0 ) ( 01, 0 ) ( 01, 1 ) ( 11, 3 ) ( 00, 0 ) ( 10, 0 ) ( 10, − 2 ) ( 01, − 1 ) ( 11, − 3 ) ( 10, 2 ) Gary Greaves — Edge-regular graphs and regular cliques 10/13

Recommend

On cliques in edge-regular graphs Leonard Soicher Queen Mary University of London Modern Trends

On cliques in edge-regular graphs Leonard Soicher Queen Mary University of London Modern Trends

On cliques in edge-regular graphs Leonard Soicher Queen Mary University of London Modern Trends in Algebraic Graph Theory, Villanova, 2014 Leonard Soicher (QMUL) Cliques in ERGs Villanova, 2014 1 / 10 The setup All graphs in this talk are

504 views • 19 slides
A new bound for cliques in strongly regular graphs Jack Koolen School of Mathematical

A new bound for cliques in strongly regular graphs Jack Koolen School of Mathematical

Introduction Bounded smallest eigenvalue The new bound Some other recent results A new bound for cliques in strongly regular graphs Jack Koolen School of Mathematical Sciences University of Science and Technology of China (Based on

1.46k views • 84 slides
On strongly regular graphs attaining the claw bound M. Ma caj Comenius University,

On strongly regular graphs attaining the claw bound M. Ma caj Comenius University,

On strongly regular graphs attaining the claw bound M. Ma caj Comenius University, Bratislava, Slovakia Villanova, June 5th 2014 Strongly regular graphs A k -regular graph on n vertices is strongly regular with parame- ters ( n, k, , )

523 views • 29 slides
On the limit approach to random regular graphs Bal azs Szegedy Joint work with Agnes

On the limit approach to random regular graphs Bal azs Szegedy Joint work with Agnes

On the limit approach to random regular graphs Bal azs Szegedy Joint work with Agnes Backhausz Two papers On large girth regular graphs and random processes on trees , ArXiv On the almost eigenvectors of random regular graphs , In

430 views • 27 slides
Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence

Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence

Directed strongly regular graphs(DSRG) Combinatorial Designs Construction of Directed Strongly Regular Graphs References Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence Structures Oktay Olmez

645 views • 37 slides
Distance-regular Cayley graphs of abelian groups Stefko Miklavi c University of Primorska

Distance-regular Cayley graphs of abelian groups Stefko Miklavi c University of Primorska

Definition Distance-regular cayley graphs over cyclic groups Distance-regular cayley graphs over dihedral groups Minimal distance-regular Cayley graphs on abelian groups Distance-regular Cayley graphs of abelian groups Stefko

778 views • 30 slides
On highly regular strongly regular graphs Christian Pech TU Dresden MTAGT14, Villanova in

On highly regular strongly regular graphs Christian Pech TU Dresden MTAGT14, Villanova in

On highly regular strongly regular graphs Christian Pech TU Dresden MTAGT14, Villanova in June 2014 Ch. Pech On highly regular strongly regular graphs June 2014 1 / 20 k -Homogeneity The local-global principle Every isomorphism between

472 views • 24 slides
Friendship in Edge-Regular Graphs Kelly Bragan; James Hammer; Pete Johnson, Auburn University;

Friendship in Edge-Regular Graphs Kelly Bragan; James Hammer; Pete Johnson, Auburn University;

Outline Introduction Description of all ER ( n 4 1 ) Preliminary work on ER ( n d 2 ) Friendship in Edge-Regular Graphs Kelly Bragan; James Hammer; Pete Johnson, Auburn University; and Ken Roblee, Troy University

346 views • 32 slides
Random Regular Graphs and Differential Equations Nick Wormald University of Waterloo Minicourse

Random Regular Graphs and Differential Equations Nick Wormald University of Waterloo Minicourse

Random Regular Graphs and Differential Equations Nick Wormald University of Waterloo Minicourse Conference on Random Graph Processes Austin Regular graphs - Uniform model Regular graphs - Uniform model G n , d : probability space

1.08k views • 68 slides
T HE PERMUTATION MODEL G ( n , 2 d ) 1 , . . . , d iid uniform permutations. Superimpose. T

T HE PERMUTATION MODEL G ( n , 2 d ) 1 , . . . , d iid uniform permutations. Superimpose. T

E IGENVALUES OF SPARSE RANDOM REGULAR GRAPHS Soumik Pal University of Washington Seattle Seminar on Stochastic Processes, 2012 G RAPHS AND ADJACENCY MATRICES 3 2 Undirected graphs on n labeled vertices. 4 1 Regular: degree d . 5 6

1.02k views • 70 slides
The Cheeger constant for distance-regular graphs Greg Markowsky (joint work with Jacobus Koolen

The Cheeger constant for distance-regular graphs Greg Markowsky (joint work with Jacobus Koolen

The Cheeger constant for distance-regular graphs Greg Markowsky (joint work with Jacobus Koolen and Zhi Qiao) August 9, 2019 Graphs A graph is a set of vertices V (can be taken to be { 1 , 2 , . . . , n } ) and edges E , where each edge is an

787 views • 26 slides
Random Walks and Electric Resistance on Distance-Regular Graphs Greg Markowsky March 16, 2011

Random Walks and Electric Resistance on Distance-Regular Graphs Greg Markowsky March 16, 2011

Random Walks and Electric Resistance on Distance-Regular Graphs Greg Markowsky March 16, 2011 Graphs A graph is a set of vertices V (can be taken to be { 1 , 2 , . . . , n } ) and edges E , where each edge is an element of V V . We assume all

729 views • 48 slides
T HE PERMUTATION MODEL G ( n , 2 d ) 1 , . . . , d iid uniform permutations. Superimpose. T

T HE PERMUTATION MODEL G ( n , 2 d ) 1 , . . . , d iid uniform permutations. Superimpose. T

S PECTRAL DYNAMICS OF RANDOM REGULAR GRAPHS AND THE P OISSON FREE FIELD Soumik Pal The Pitman conference June 21, 2014 G RAPHS AND ADJACENCY MATRICES 3 2 Undirected graphs on n labeled vertices. 4 1 Regular: degree d . 5 6 Adjacency

640 views • 40 slides
Regular a regular expression I Example 1.68 Consider the following DFA b a 1 2 a b a

Regular a regular expression I Example 1.68 Consider the following DFA b a 1 2 a b a

Regular a regular expression I Example 1.68 Consider the following DFA b a 1 2 a b a b 3 September 22, 2020 1 / 10 Regular a regular expression II It is not that easy to directly see what the regular expression is We need a

140 views • 10 slides
Strongly Regular Cayley Graphs in Rank Two Abelian Groups Ken W. Smith Mt. Pleasant, MI 2015

Strongly Regular Cayley Graphs in Rank Two Abelian Groups Ken W. Smith Mt. Pleasant, MI 2015

Strongly Regular Cayley Graphs in Rank Two Abelian Groups Ken W. Smith Mt. Pleasant, MI 2015 Smith Cayley SRGs 2015 1 / 61 Strongly Regular Cayley Graphs in C p n C p n Strongly regular graphs play a central role in algebraic

1.56k views • 129 slides
Geometric distance-regular graphs J. Koolen Department of Mathematics POSTECH May 20, 2009

Geometric distance-regular graphs J. Koolen Department of Mathematics POSTECH May 20, 2009

Distance-regular graphs The Bannai-Ito Conjecture Geometric DRG Open Problems and Conjectures Geometric distance-regular graphs J. Koolen Department of Mathematics POSTECH May 20, 2009 Distance-regular graphs The Bannai-Ito Conjecture

407 views • 37 slides
t -Walk-regular graphs, scheme graphs and 2-partially metric association schemes Jack Koolen

t -Walk-regular graphs, scheme graphs and 2-partially metric association schemes Jack Koolen

t -Walk-regular graphs Some results Examples with relatively many eigenvalues Association schemes Multiplicity results t -Walk-regular graphs, scheme graphs and 2-partially metric association schemes Jack Koolen This is based on joint work

1.46k views • 113 slides
Closure under the Regular Operations Closure under the Regular Operations p.1/26

Closure under the Regular Operations Closure under the Regular Operations p.1/26

Closure under the Regular Operations Closure under the Regular Operations p.1/26 Application of NFA Now we use the NFA to show that the collection of regular languages is closed under regular operations union, concatenation, and star

1.15k views • 55 slides
Analysis of Random Processes on Regular Graphs With Large Girth Nick Wormald Monash University

Analysis of Random Processes on Regular Graphs With Large Girth Nick Wormald Monash University

Analysis of Random Processes on Regular Graphs With Large Girth Nick Wormald Monash University Joint work with Carlos Hoppen Background: independent sets in regular graphs If ( G ) = d then ( G ) n / ( d + 1 ) . Background:

983 views • 69 slides
U i 0 1 2 3 4 L L L L L L L ... = = language and: i 0 =

U i 0 1 2 3 4 L L L L L L L ... = = language and: i 0 =

Regular Expressions Another means to describe languages Regular Expressions accepted by Finite Automata. In some books, regular languages, by definition, are described using regular expressions. Specifying Languages Regular Languages

256 views • 6 slides
THE CHROMATIC INDEX OF STRONGLY REGULAR GRAPHS Willem H. Haemers joint work with Sebastian M.

THE CHROMATIC INDEX OF STRONGLY REGULAR GRAPHS Willem H. Haemers joint work with Sebastian M.

THE CHROMATIC INDEX OF STRONGLY REGULAR GRAPHS Willem H. Haemers joint work with Sebastian M. Cioab a and Krystal Guo The chromatic index (edge-chromatic number) ( G ) of a graph G is the minimum number of colors needed to color the

814 views • 30 slides
Strongly Regular Graphs Related to Polar Spaces Ferdinand Ihringer Hebrew University of

Strongly Regular Graphs Related to Polar Spaces Ferdinand Ihringer Hebrew University of

Strongly Regular Graphs Related to Polar Spaces Ferdinand Ihringer Hebrew University of Jerusalem, Jerusalem, Israel 14 September 2017 Fifth Irsee Conference Strongly Regular Graphs Old Techniques for New SRGs A New Technique for New SRGs

423 views • 31 slides
Strongly regular graphs and substructures of finite classical polar spaces Jan De Beule

Strongly regular graphs and substructures of finite classical polar spaces Jan De Beule

Strongly regular graphs An easy example from finite geometry Cameron-Liebler line classes Finite classical polar spaces Strongly regular graphs and substructures of finite classical polar spaces Jan De Beule Department of Mathematics Ghent

630 views • 33 slides
MA/CSSE 474 Theory of Computation How many regular/non-regular languages are there? Closure

MA/CSSE 474 Theory of Computation How many regular/non-regular languages are there? Closure

1/7/2016 MA/CSSE 474 Theory of Computation How many regular/non-regular languages are there? Closure properties of Regular Languages (if there is time) Pumping Theorem Your Questions? Previous class days' HW 7 problems material

299 views • 16 slides

More recommend