Step 1

Given:

Circ \(\displaystyle{\left[{n},{\left\lbrace{k},{l}\right\rbrace}\right]}\)

To find the number of edges in the circulant graph.

Step 2

Solution:

In circulant graph circle \(\displaystyle{\left[{n},{\left\lbrace{k},{l}\right\rbrace}\right]}\) total number of vertices are n and connectivity of the graph is \(\displaystyle{\left\lbrace{k}.{l}\right\rbrace}\)

So total number of edges in the graph is given by \(\displaystyle{E}={\frac{{{n}{\left({n}-{2}\right)}}}{{{2}}}}.\)

Thus the answer is arrived.

Given:

Circ \(\displaystyle{\left[{n},{\left\lbrace{k},{l}\right\rbrace}\right]}\)

To find the number of edges in the circulant graph.

Step 2

Solution:

In circulant graph circle \(\displaystyle{\left[{n},{\left\lbrace{k},{l}\right\rbrace}\right]}\) total number of vertices are n and connectivity of the graph is \(\displaystyle{\left\lbrace{k}.{l}\right\rbrace}\)

So total number of edges in the graph is given by \(\displaystyle{E}={\frac{{{n}{\left({n}-{2}\right)}}}{{{2}}}}.\)

Thus the answer is arrived.