Available online at www.sciencedirect.

com
Available online at www.sciencedirect.com
ScienceDirect
Available online at www.sciencedirect.com
ScienceDirect
Procedia Computer Science 00 (2019) 000–000
ScienceDirect
Procedia Computer Science 00 (2019) 000–000 www.elsevier.com/locate/procedia
Procedia Computer Science 167 (2020) 1038–1045 www.elsevier.com/locate/procedia

International Conference on Computational Intelligence and Data Science (ICCIDS 2019)

International Conference on Computational Intelligence and Data Science (ICCIDS 2019)
A novel algorithm for generating an edge-regular graph
A novel algorithm for generating an edge-regular graph
Saad Qasim Abbasa,*, Huda Amer Abd Almeerb, Wasan Saad Ahmedc, Ali Thaeer
Saad Qasim Abbasa,*, Huda Amer Abd Almeer
Hammid d b, Wasan Saad Ahmedc, Ali Thaeer

Hammidd
a
Medical Instruments Techniques Engineering department, Bilad Al Rafidain University College, Diyala, Iraq
Medical InstrumentsMathematical science department, University
Bilad AlofRafidain
Diyala, Diyala, Iraq
b
a
Techniques Engineering department, University College, Diyala, Iraq
b cComputer science department, University of Diyala, Diyala, Iraq
Mathematical science department, University of Diyala, Diyala, Iraq
d
Department of ComputercComputer
Engineering Techniques,
science Al Yarmouk
department, University
University College,
of Diyala, Diyala,32001
Iraq Ba'aqubah, Diyala, Iraq
d
Department of Computer Engineering Techniques, Al Yarmouk University College, 32001 Ba'aqubah, Diyala, Iraq

Abstract
Abstract
Most recent research in graph theory considered the studying of edge regular graph class 𝐸𝐸𝐸𝐸(𝑛𝑛, 𝑑𝑑, 𝜆𝜆) for some 𝑛𝑛 > 𝑑𝑑 > 𝜆𝜆, such
that all
Most the 𝑛𝑛research
recent verticesinhavegraph𝑑𝑑 adjacent neighbors,the
theory considered andstudying
each pair of adjacent
of edge regularvertices have𝐸𝐸𝐸𝐸(𝑛𝑛,
graph class 𝜆𝜆 common neighbors,
𝑑𝑑, 𝜆𝜆) for some 𝑛𝑛 none
> 𝑑𝑑 >of𝜆𝜆, these
such
research
that gave
all the an algorithm
𝑛𝑛 vertices have to𝑑𝑑 generate
adjacent this class with
neighbors, andconsidering theadjacent
each pair of 𝜆𝜆 , in thisvertices
paper, ahave
novel algorithmneighbors,
𝜆𝜆 common to generatenone
randomof edge-
these
regular graphs
research gave anforalgorithm
𝜆𝜆 > 0 . The algorithm
to generate thisproduces anconsidering
class with edge-regular
thegraph
𝜆𝜆 , infor
thisdifferent
paper, a values of 𝑑𝑑 and 𝑛𝑛.
novel algorithm to Moreover, it is easy
generate random to
edge-
implement
regular and for
graphs quite
𝜆𝜆 >fast
0 .inThe
practice. Theproduces
algorithm Matlab programming language
an edge-regular graph used to obtainvalues
for different the experimental result. Theitanalysis
of 𝑑𝑑 and 𝑛𝑛. Moreover, is easy ofto
this methodand
implement showed
quitethat
fastthe
in running
practice.time
The of this method
Matlab proven to
programming be O(𝒅𝒅𝟑𝟑used
language ). to obtain the experimental result. The analysis of
this method showed that the running time of this method proven to be O(𝒅𝒅𝟑𝟑 ).
© 2019 The Authors. Published by Elsevier B.V.. This is an open access article under the CC BY-NC-ND license
© 2020 The Authors. Published by Elsevier B.V.
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
© 2019 The Authors. Published by Elsevier B.V.. This is an open access article under the CC BY-NC-ND license
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Peer-review under responsibility of the scientific committee of the International Conference on Computational Intelligence and
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
Peer-review under responsibility of the scientific committee of the International Conference on Computational Intelligence and Data
Data Science
Peer-review
Science (ICCIDS
under
(ICCIDS 2019)
responsibility
2019). of the scientific committee of the International Conference on Computational Intelligence and
Data Science (ICCIDS 2019)
Keywords: Edge regular graph; Graph theory; Algorithm.
Keywords: Edge regular graph; Graph theory; Algorithm.

1. Introduction
1. Introduction
One of the most critical research of combinatorics mathematics fields and theoretical computer science is the edge-
One of
regular the most
graph. Thiscritical
work research of combinatorics
considered as a novel workmathematics fields
to generate an and theoreticalgraph
edge-regular computer
withscience is thealmost
n vertices edge-
regular graph.
uniformly This work
at random, considered
this algorithm as a novel
considered as a work toway
reliable generate an edge-regular
to produce graph
the edge-regular withbecause
graph n vertices almost
it generates
uniformly
graphs for atanrandom, thisrange
enormous algorithm considered
of vertices’ as a reliable
numbers. way to produce
The algorithm in thisthe edge-regular
paper graph because
tasted, although it generates
the result was not
graphs for an enormous range of vertices’ numbers. The algorithm in this paper tasted, although the result was not

* Corresponding author. Tel.: +964-772-187-2667

* E-mail Drsaad@bauc14.edu.edu.iq
address:author.
Corresponding Tel.: +964-772-187-2667
E-mail address: Drsaad@bauc14.edu.edu.iq

1877-0509 © 2019 The Authors. Published by Elsevier B.V.. This is an open access article under the CC BY-NC-ND license
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
1877-0509 © 2019 The Authors. Published by Elsevier B.V.. This is an open access article under the CC BY-NC-ND license
Peer-review under responsibility of the scientific committee of the International Conference on Computational Intelligence and Data Science
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
(ICCIDS
Peer-review2019)
under responsibility of the scientific committee of the International Conference on Computational Intelligence and Data Science
1877-0509 © 2020 The Authors. Published by Elsevier B.V.
(ICCIDS
This is an 2019)
open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Peer-review under responsibility of the scientific committee of the International Conference on Computational Intelligence and Data
Science (ICCIDS 2019).
10.1016/j.procs.2020.03.403
 Saad Qasim Abbas et al. / Procedia Computer Science 167 (2020) 1038–1045 1039
2 Saad Qasim Abbas et al. / Procedia Computer Science 00 (2019) 000–000

uniformly at random, it was approximately uniformly at random, especially when the degrees of vertices insignificant.
Moreover, it is easy to implement and very fast in practice.
The same standard notation and symbols used in [1] are used in this paper, to introduce the definitions, Let 𝑛𝑛 >
𝑑𝑑 ≥ 𝜆𝜆 be positive integers, and 𝐸𝐸𝐸𝐸(𝑛𝑛, 𝑑𝑑, 𝜆𝜆) be the set of all simple graphs (ER comes from Edge regular ), the graph
𝐺𝐺 = (𝑉𝑉; 𝐸𝐸) = (𝑉𝑉 (𝐺𝐺); 𝐸𝐸(𝐺𝐺)), will denoted as simple graph, so that the number of vertices in 𝐺𝐺 is 𝑛𝑛, all the graphs
are regular and of degree 𝑑𝑑, the symbol 𝜆𝜆 represent all number of vertices adjacent to any common vertices 𝑢𝑢 and 𝑣𝑣,
such that when 𝑢𝑢, 𝑣𝑣 ∈ 𝐸𝐸 , then |𝑁𝑁(𝑢𝑢, 𝑣𝑣)| = 𝜆𝜆 , where 𝑁𝑁(𝑢𝑢, 𝑣𝑣) is a subset from all vertices set 𝑉𝑉, include the adjacent
vertices of both 𝑢𝑢 and 𝑣𝑣. The graph which has these properties called Edge-Regular graph, and sometimes they denoted
as nearly strongly regular graphs [2].
The work has Five sections. Section 1 made a brief review of similar studies in Edge-Regular graph, and then based
on this review, in Section 2, illustrated the algorithm shown in this paper. In Section 3, some example is given of the
program’s output for different value of 𝑛𝑛 and 𝑑𝑑. The results in Section 4 shows the running time of the algorithm
which is 𝑂𝑂(𝑑𝑑 3 ). The performance of the main Algorithm and the proof of the runtime of the algorithm given in the
last Section.

2. Literature Survey

The study of edge-regular graph recently received considerable attention in the mathematical literature. Since its
introduction n the 70’s [3], especially when all degrees are equal, and there is no need to impose restrictions on the
variation in the degrees [4]. Finding the d-regular graph by computers generation uniformly, implicitly appeared in
Bollobas’s work [5], while the approaches to counting regular graphs by Bender and Canfield (see [6] and [7]).
The theory of distance-regular graphs widely developed in the last decades, Bostjan and Miklavic [8] classified
edge-regular graph, to be either a sturdy product, a lexicographic product or a deleted lexicographic product, also the
classification of the graph if it is amply or not has been determined.
Finding the numbers of vertices 𝑛𝑛 and degrees 𝑑𝑑, in which it guaranteed the existence of edge-regular graphs with
𝜆𝜆 = 1 investigated by K. Bragan [9], the edge-regular graphs was focused such that each vertex has as its open
neighborhood and the analysis of disjoint union of complete graphs. H. Soicher [10] determine an upper bound to edge-
regular graph numbers, the properties of some subset and used the groups and graphs have been studied by focusing
on essential examples. An edge regular is said to be strongly regular if every pair of distinct nonadjacent vertices has
the same familiar neighbors. A clique in a graph is a set of pairwise adjacent vertices, Not every regular edge graphs
is strongly regular even it has cliques, Greaves and Koolen [11] listed many edge-regular graphs examples, shown that
even there are regular cliques graphs, but it not necessary they are strongly regular. In [12] a new type of regularity was
considered by generalization the concepts of the regular edge graph called edge-girth regular graphs, besides the
studies of the fundamental properties like the relation of this graph with regular embedded graphs in orientable
surfaces.
Tinhofer [13] presented generating algorithms, but it was not easy to analyse. On the other hand, Jerrum and Sinclair
[14]
do not precisely analyze the running time of their algorithm. Chung [15] found an interesting way to get the regular
graph even it is a sophisticated little bit. McKay and Wormald [16] create a useful model of the degree sequence of a
random graph in 𝐺𝐺(𝑛𝑛, 𝑝𝑝) based on the works appears in [17] and [18].
In [19] The number of short cycles in random regular graphs has been investigated, especially when the number of
degrees is small, it been shown that the distribution of random has asymptotically Poisson distribution, as is the usual
rule with the sum of many nearly independent rare events. (This effect is called the “Poisson paradigm”)
The algorithm presented her depends on the pairing model (some time called the configuration model), the argument
in [20] and [21], gave the number of configurations in which ,no two vertices in the same cell are of the same class, which
will give to the number of pairings induce no loops in the multigraph. The algorithm in this paper can be illustrated
as follow : Suppose the set 𝑆𝑆 be a set of integers, the numbers of integers in 𝑆𝑆 is even and equal to 𝑛𝑛𝑛𝑛, the numbers
distributed on 𝑛𝑛 layers , and let 𝑃𝑃 be any random pairing of these numbers , the graph 𝐺𝐺 can be created a graph 𝐺𝐺
based on 𝑃𝑃 such that an edge 𝑒𝑒𝑖𝑖𝑖𝑖 exists if there is a pair in 𝑃𝑃 containing integers in the 𝑖𝑖′𝑡𝑡ℎ and 𝑗𝑗′𝑡𝑡ℎ layers. The graph
𝐺𝐺 will contain a loop if the chosen pair a containing integer from the same verticals layer. The graph 𝐺𝐺 will be called
a 𝑑𝑑-regular graph and occurs a uniformly at random if there is no loop in it.
1040 Saad Qasim Abbas et al. / Procedia Computer Science 167 (2020) 1038–1045
Saad Qasim Abbas et al. / Procedia Computer Science 00 (2019) 000–000 3

3. The main Algorithm

As mentioned before, the algorithm considered as a modification of the pairing algorithm described above. To start
with the first steps, we need to consider two integers named 𝑖𝑖 and 𝑗𝑗 (they will be called vertices later) to be appropriate
if it satisfies all conditions illustrated in the algorithm. The execution time of the Algorithm to generate one graph is
𝑂𝑂(𝑑𝑑 3 ). Assume that there is a pair that contains integers from the same two verticals layers. Now the algorithm can
be described as follows

1. Suppose there are 𝑛𝑛𝑛𝑛 integers, where the integers 1 to 𝑑𝑑 repeated 𝑛𝑛 times, i.e., {1,2 … 𝑑𝑑, 1,2 … 𝑑𝑑, … ,1,2 … 𝑑𝑑}, as
mentioned before 𝑛𝑛𝑛𝑛 is an even number. These 𝑛𝑛𝑛𝑛 integers are distributed in 𝑛𝑛 layers as illustrated in Fig.1
below:

Fig. 1.

Put the set to be the set of an unpaired point set,

𝑈𝑈 = {1,2 … 𝑑𝑑, 1,2 … 𝑑𝑑, … ,1,2 … 𝑑𝑑} ()

2. This step will be repeated many times until finding the appropriate vertices, selected any two random integers 𝑖𝑖
and 𝑗𝑗 from the set 𝑈𝑈, test these two integers to see if they are appropriate or not, to be appropriate they should
satisfy the following:

a) Both 𝑖𝑖 and 𝑗𝑗 belong to two different 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑖𝑖 and 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑗𝑗 .

b) To describe this condition, the connection matrix 𝑀𝑀𝐺𝐺 will be created, which represent the connected edges
gathering the vertices, for simplicity, will consider exampled Graph 𝐺𝐺 , The number of vertices in it is 9 (𝑛𝑛 =
9), the degree of the vertices is 6 (𝑑𝑑 = 6), the number of common neighbor vertices between any vertex is 4
(𝜆𝜆 = 4) as shown in Fig. 2.

Fig. 2. The exampled Graph 𝐺𝐺

The connection matrix 𝑀𝑀𝐺𝐺 of the exampled graph will be as follows

 4 Saad Qasim Abbas et al. / Procedia Computer Science 00 (2019) 000–000
Saad Qasim Abbas et al. / Procedia Computer Science 167 (2020) 1038–1045 1041

𝑣𝑣1 𝑣𝑣2 . . . 𝑣𝑣𝑣𝑣 . . . 𝑣𝑣𝑣𝑣 . . . 𝑣𝑣8 𝑣𝑣9

𝑣𝑣1 0 1 … 1 … 0 … 1 1
𝑣𝑣2 1 0 … 1 … 1 … 0 1
⋮ ⋮ ⋮ ⋮
𝑣𝑣𝑣𝑣 1 1 … 0 1 1 … 1 0
𝑀𝑀𝐺𝐺 = ⋮ ⋮ ⋮ ⋮
𝑣𝑣𝑣𝑣 0 1 … 1 0 0 … 1 1
⋮ ⋮ ⋮ ⋮
𝑣𝑣8 1 0 … 1 … 1 … 0 1
𝑣𝑣9 [1 0 … 0 … 1 … 1 0]

Fig. 3.

c) The two vertices 𝑣𝑣𝑣𝑣 and 𝑣𝑣𝑣𝑣 will be chosen if there is no integer greater than 1 in the column or row where they
belong to (that satisfied) in our exampled graph 𝐺𝐺), the number of 1’s are equal in their columns and rows, the
number of consecutive 1’s in the 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑖𝑖 and 𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑗𝑗 are the same and equal to 𝜆𝜆. (all these conditions exist
in any vertex belong to the exampled graph 𝐺𝐺), any two vertices 𝑣𝑣𝑣𝑣 and 𝑣𝑣𝑣𝑣 satisfies the above conditions will
be considered as appropriate and will delete from the set 𝑈𝑈.

3. Selecting other vertices and see if they are appropriate or not, if they are appropriate to repeat step 3 until deleting
all the pairs in 𝑈𝑈 and go to step 4, if not then repeat Step1.

4. Great a graph 𝐺𝐺 such that all the vertices are appropriate, and this graph is an edge-regular graph.

The Algorithm present in this paper is an upgrade to the algorithm shown in [22] and [23]. There, the algorithm
produces a d-regular graph only, it started with 𝑛𝑛 vertices and added up edges randomly, with keeping the highest
degree of all vertices equals 𝑑𝑑 (and without allowing more than one edges between to vertices). In [23] Ruciński and
Wormald prove that it is possible to generate a d-regular graph if 𝑑𝑑 is not extremely large and 𝑑𝑑𝑑𝑑 is even, They
modified the selection of the edges in uniform procedures using the following algorithm:

1. Suppose there is a graph 𝐺𝐺, the number of vertices is 𝑛𝑛 = {1,2, . . . , 𝑛𝑛} without any edge connected his vertices.

2. Let 𝑆𝑆 be the set of all non-adjacent vertices of 𝐺𝐺, the degree of all vertices is up to 𝑑𝑑 − 1. The algorithm will
repeat this step until emptying the set S. Choose any pair of vertices (𝑢𝑢, 𝑣𝑣) from 𝑆𝑆, the probability of choosing
any pair is proportion to (𝑑𝑑 − 𝑑𝑑(𝑢𝑢))(𝑑𝑑 − 𝑑𝑑(𝑣𝑣)), then add the edge between 𝑢𝑢 and 𝑣𝑣 to 𝐺𝐺.

3. Check if G is d-regular if so stop, otherwise go to step number 1.

4. This algorism can be upgraded to produce an edge- regular graph instead of a d-regular graph, even though the
algorithms seems to be different from outside, they actually equivalent from the core, in fact, the probability of
choosing the vertices from two different Layer's in the Algorithm is precisely the probability of edges in the last
algorithm [10], this study will focus on the first algorithm.

4. Experiential result

To test the algorithm presented in this work, Matlab language R2017a installed on computer core i7 seven
generations to generate five examples of the edge- regular graph with a different value of 𝑛𝑛, 𝑑𝑑, and 𝜆𝜆 as shown in Fig.4
below
1042 SaadSaad
Qasim Abbas
Qasim et al.et/ Procedia
Abbas Computer
al. / Procedia Science
Computer 00 (2019)
Science 000–000
167 (2020) 1038–1045 5

𝑛𝑛=6 𝑑𝑑=5 𝜆𝜆 =4

𝑛𝑛=8 𝑑𝑑=6 𝜆𝜆 =4
 Saad Qasim Abbas et al. / Procedia Computer Science 167 (2020) 1038–1045 1043
6 Saad Qasim Abbas et al. / Procedia Computer Science 00 (2019) 000–000

𝑛𝑛=10 𝑑𝑑=1 𝜆𝜆 =0

𝑛𝑛=16 𝑑𝑑=11 𝜆𝜆 =6

𝑛𝑛=16 𝑑𝑑=15 𝜆𝜆 =14

Fig. 4. Five examples of edge-regular graphs with a different value of n,d, and λ

5. Performance of the main Algorithm

In this Section, the complexity of the algorithm has been shown as a function defined by the number of vertices
𝑛𝑛 and the degree of the graphs 𝑑𝑑.
Theorem 4.1. The runtime of the Algorithm is 𝑂𝑂(𝑑𝑑 3 ).
Proof: To prove this theorem Step2 and Step3 of the Algorithm are considered because all mathematical calculation
happened inside them. First, two arrays will be considered, the first one is the 𝑈𝑈 array (Equation 1), which contains
all unpaired vertices of 𝐺𝐺
1044 Saad
Saad Qasim
Qasim Abbas
Abbas et al.et/al. / Procedia
Procedia Computer
Computer Science
Science 167 (2020)
00 (2019) 1038–1045
000–000 7

𝑈𝑈 = 1,2, … , 𝑑𝑑, 1,2, … , 𝑑𝑑, … ,1,2, … , 𝑑𝑑

^
^
^
1 2 n times
›’‡‡“—ƒ–‹‘Š‡”‡Ǥ

The second array is the 𝐼𝐼 array , it holds the positions of the 𝑈𝑈 elements, that is, the 𝑖𝑖th element of 𝐼𝐼 represent the
position of the element 𝑖𝑖 in 𝑈𝑈 , the algorithms start by choosing any two vertices 𝑖𝑖 and 𝑗𝑗 randomly from 𝑈𝑈, then check
if they are appropriate or not, that required 𝑂𝑂(𝑑𝑑 3 ) time, since there are 𝑛𝑛𝑛𝑛 elements must be checked, in addition to
that, all the remaining (𝑛𝑛 − 1)(𝑑𝑑 − 1) elements of 𝑈𝑈 can be checked in time 𝑂𝑂(𝑛𝑛𝑛𝑛), Now if the selected vertex was
appropriate, then update 𝑈𝑈 by deleting the two vertices from 𝑈𝑈, (if the pairs are 𝑖𝑖 and 𝑗𝑗) then swapping 𝑈𝑈 with a newly
updated array

𝑈𝑈 = {𝑈𝑈(1 … 𝑈𝑈(𝐼𝐼(𝑖𝑖) − 1), 𝑈𝑈(𝐼𝐼(𝑖𝑖) + 1) … (𝑈𝑈(𝐼𝐼(𝑗𝑗) − 1), 𝑈𝑈(𝐼𝐼(𝑗𝑗) + 1 … 𝑈𝑈(𝑙𝑙𝑙𝑙𝑙𝑙𝑙𝑙 𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒 𝑜𝑜𝑜𝑜 𝐼𝐼)} ()

The program will update the array 𝑈𝑈 constantly each time to find the appropriated pair. This step of the algorithm will
be repeated until deleting all the elements of 𝑈𝑈, that shows that the total time for finding the edge-regular graph is
𝑂𝑂(𝑑𝑑3 )

6. Conclusions and future work

This work suggests an Algorithm to find an edge regular graph, for any number of vertices 𝑛𝑛 , any degree 𝑑𝑑 , and 𝜆𝜆 >
0 of common neighbour between each pair of adjacent vertices. It has been shown that the running time of the
algorithm is of order 𝑂𝑂(𝑑𝑑 3 ), conclude that this algorithm is fast and reliable since it can generate graphs for enough
significant value of 𝑛𝑛 in relevant small time. The algorithm needs more research to calculate the required space for
the algorithm. Also, upgrading the algorithm can be done to generate another kind of graphs like strong regular graphs.
The scope for improving the security levels and to use for real time appliation is possible with the integration of
blockchain technology [24, 25].

References

[1] D. B. West, Introduction To Graph Theory, 2nd ed. Prentice-Hall, 2001.

[2] K. Coolsaet, P. D. Johnson, K. J. Roblee, and T. D. Smotzer, “Some extremal problems for edge-regular graphs,” Ars Comb., vol. 105,
pp. 411–418, 2012.
[3] E. E. Shult, “Characterizations of certain classes of graphs,” J. Comb. Theory, Ser. B, vol. 13, no. 2, pp. 142–167, 1972.
[4] and A. J. S. M.R. Jerrum, B.D. McKay, “When is a graphical sequence stable?,” Random Graphs, vol. 2, pp. 148–188, 1992.
[5] Hammid, A.T., M.H.B. Sulaiman, and A.N. Abdalla, Prediction of small hydropower plant power production in Himreen Lake dam
(HLD) using artificial neural network. Alexandria Engineering Journal, 2018. 57(1): p. 211-221.
[6] E. A. Bender and E. R. Canfield, “The asymptotic number of labeled graphs with given degree sequences,” J. Comb. Theory, Ser. A,
1978.
[7] Hammid, A.T., M.H.B. Sulaiman, and O.I. Awad, A robust firefly algorithm with backpropagation neural networks for solving
hydrogeneration prediction. Electrical Engineering, 2018: p. 1-17.
[8] B. Frelih and Š. Miklavič, “Edge regular graph products,” Electron. J. Comb., vol. 20, no. 1, pp. 1–17, 2013.
[9] K. Bragan, “Topics in Edge Regular Graphs,” Auburn University, 2014.
[10] L. H. Soicher, “On cliques in edge-regular graphs,” J. Algebr., vol. 421, pp. 260–267, 2015.
[11] G. R. W. Greaves and J. H. Koolen, “Edge-regular graphs with regular cliques,” Eur. J. Comb., vol. 71, no. June, pp. 194–201, 2018.
[12] R. Jajcay, G. Kiss, and Š. Miklavič, “Edge-girth-regular graphs,” Eur. J. Comb., vol. 72, pp. 70–82, 2018.
[13] Hammid, A.T., et al., Load Frequency Control for Hydropower Plants using PID Controller. Journal of Telecommunication, Electronic
and Computer Engineering (JTEC), 2016. 8(10): p. 47-51.
[14] Hammid, A.T. and M.H.B. Sulaiman, Series division method based on PSO and FA to optimize Long-Term Hydro Generation
 Saad Qasim Abbas et al. / Procedia Computer Science 167 (2020) 1038–1045 1045
8 Saad Qasim Abbas et al. / Procedia Computer Science 00 (2019) 000–000

Scheduling. Sustainable Energy Technologies and Assessments, 2018. 29: p. 106-118.

[15] B. Bollobás and F. R. K. Chung, “Probabilistic Combinatorics and Its Applications,” Amer. Math. Soc, p. 196, 1991.
[16] Hammid, A.T., M.H.B. Sulaiman, and A.A. Kadhim, Optimum Power Production of Small Hydropower Plant (SHP) using Firefly
Algorithm (FA) in Himreen Lake Dam (HLD), Eastern Iraq. Research Journal of Applied Sciences, 2017. 12(10): p. 455-466.
[17] B. D. McKay and N. C. Wormald, “Asymptotic Enumeration by Degree Sequence of Graphs of High Degree,” Eur. J. Comb., 1990.
[18] Hammid, A.T., A. Bhardwaj, and S. Prakash, Design Remote Power Control I/O Data Acquisition System and Control on Home
Automation. IJECCE, 2013. 4(2): p. 528-535.
[19] N. A. & J. H. Spencer, The Probabilistic Method, Wiley, New York (1992). 1992.
[20] P. B. & J. K. A. B´ek´essy, “Asymptotic enumeration of regular matrices,” Stud. Sci. Math. Hungarica, vol. 7, pp. 343–353, 1972.
[21] Hammid, A.T. and M.H. Sulaiman. Optimal Long-Term Hydro Generation Scheduling of Small Hydropower Plant (SHP) using
Metaheuristic Algorithm in Himreen Lake Dam. in MATEC Web of Conferences. 2017. EDP Sciences.
[22] A. Steger and N. C. Wormald, “Generating Random Regular Graphs Quickly,” Comb. Probab. Comput., vol. 8, no. 4, pp. 377–396,
1999.
[23] Hammid, A.T., Applications of Tuning Control Actions for the Efficient Load/frequency Control in Steam Turbine. International Journal
of Current Engineering and Technology, 2013. 3(5): p. 1895-1898.
[24] Kumar, N.M., Blockchain: Enabling wide range of services in distributed energy system. Beni-Suef University journal of basic and
applied sciences, 2018. 7(4), pp.701-704.
[25] Kumar, N.M. and Mallick, P.K., Blockchain technology for security issues and challenges in IoT. Procedia Computer Science, 2018,
132, pp.1815-1823.