[PDF] Distance Regular Graphs PDF 20 avr 2007

Theorem (Duval 1988). Suppose that there exists a directed strongly regular graph with parameters v k

Aalborg Universitet New mixed Moore graphs and directed strongly

11. dec. 2013 directed strongly regular graphs by. Leif Kjær Jørgensen. R-2013-13. December 2013. Department of Mathematical Sciences. Aalborg University.

Factorizing regular graphs

18. mar. 2019 The 4-color theorem for planar graphs is equivalent to the statement that every planar 2-edge-connected 3-regular graph can be edge-decomposed ...

Variations and Generalizations of Moore Graphs.

Two 3-regular graphs of order 38 has diameter 4: von Conta - graph (IEEE Transactions on computers 1983) has girth 7. Number of vertices at distance 01

Random regular graphs

SHORT COURSE ON RANDOM GRAPHS. LECTURE 5. Regular graphs. A vertex has degree d if it is incident with d edges. A d-regular graph has all vertices of.

On the Number of Automorphisms of a Regular Graph

A REGULAR GRAPH. NICHOLAS WORMALD. ABSTRACT. For any connected cubic graph G with 2n points the number of automorphisms of G divides 3n2n.

Distance-regular graphs arXiv:1410.6294v2 [math.CO] 15 Apr 2016

15. apr. 2016 Keywords: Distance-regular graph; survey; association scheme; P-polynomial; Q- polynomial; geometric. ?This version is published in the ...

The Expected Eigenvalue Distribution of a Large Regular Graph

Let X be a regular graph with vertex set { 12

Hamiltonian strongly regular graphs

4. mar. 2008 Theorem 1 Let ? be a k-regular k-connected graph with n vertices and smallest eigenvalue s which is not the Petersen graph. If k > 1 and. ?ns ...

Strongly regular graphs

sporadic groups arise as automorphism groups of a strongly regular graph) in regular graphs with at most 512 vertices together with some information ...

[PDF] regular graphs of given girth

3 août 2007 · This paper gives an introduction to the area of graph theory dealing with prop- erties of regular graphs of given girth A large portion of the

[PDF] Distance-regular graphs arXiv:14106294v2 [mathCO] 15 Apr 2016

15 avr 2016 · This is a survey of distance-regular graphs We present an introduction to distance- regular graphs for the reader who is unfamiliar with the

(PDF) On Extension of Regular Graphs - ResearchGate

PDF In this article we have discussed when we can extend an r-regular graph to an r+ 1 regular by only adding edges The problem has been approached

[PDF] Strongly regular graphs

In Chapter 11 we give the classification of rank 3 groups and identify in each case the corresponding strongly regular graph Everywhere there are extensive

[PDF] Triply Regular Graphs - Krystal Guo

A strongly regular graph is a graph X on n vertices that is neither complete nor empty where each vertex has degree k each pair of adjacent vertices has a

[PDF] Strongly Regular Graphs and Partial Geometries - CORE

A strongly regular graph is an association scheme with 2 classes Tue points of X are the vertices of the graph and {xy} is an edge if (xy)

[PDF] On strongly regular graphs with 2 - CORE

All graphs considered in this paper are finite undirected graphs without loops or multiple edges Such a graph G is said to be strongly regular (cf