Directed Strongly Regular Graphs Leif K. Jørgensen Aalborg
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
[PDF] Distance Regular Graphs
20 avr 2007 · In this paper we will discover some interesting properties of a particular kind of graph called distance regular graphs using algebraic
[PDF] On some Spectral and Combinatorial Properties of Distance
In general the spectrum of a graph is a very useful tool to study some of its properties In the case of the distance-regular graphs this tool is specially
[PDF] On outindependent subgraphs of strongly regular graphs
Let CCV be a vertex subset of a regular connected graph ? with ecc(C) - = ? Then we say that I is distance-regular around C if the distance partition V
What is an regular graph?
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each internal vertex are equal to each other.What is regular vs complete graph?
A graph is said to be regular or K-regular if all its vertices have the same degree K. A graph whose all vertices have degree 2 is known as a 2-regular graph. A complete graph Kn is a regular of degree n-1. Example1: Draw regular graphs of degree 2 and 3.What are 2 regular graphs?
A two-regular graph is a regular graph for which all local degrees are 2. A two-regular graph consists of one or more (disconnected) cycles.- A graph is locally regular at a vertex v if all vertices adjacent to v have degree r. A graph is thus locally irregular if for each vertex v of G the neighbors of v have distinct degrees, and these graphs are thus termed highly irregular graphs.
