GraphTheory/IsRamanujanGraph - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

Home : Support : Online Help : GraphTheory/IsRamanujanGraph

GraphTheory

  

IsRamanujanGraph

  

test if graph is Ramanujan

 

Calling Sequence

Parameters

Options

Description

Definition

Ramanujan graphs in SpecialGraphs

Examples

Compatibility

Calling Sequence

IsRamanujanGraph(G,opts)

Parameters

G

-

graph

opts

-

(optional) equation of the form parameters=true or parameters=false

Options

• 

parameters : keyword option of the form parameters=true or parameters=false. This specifies whether the parameters [d, lambda] should be returned when the graph is Ramanujan. The default is false.

Description

• 

The IsRamanujanGraph(G) command returns true if G is a Ramanujan graph and false otherwise.

Definition

• 

An undirected graph G is Ramanujan if it is a regular graph with degree d and , where  is the maximum of the absolute values of all the eigenvalues of the adjacency matrix of G excluding the greatest eigenvalue d.

• 

These graphs are named after Srinivasa Ramanujan.

Ramanujan graphs in SpecialGraphs

• 

The following are graphs in the SpecialGraphs subpackage which are Ramanujan.

Graph

Number of Vertices

d

lambda

Petersen graph

10

3

3

Icosahedron graph

12

5

sqrt(5)

Clebsch graph

16

5

3

Complete graph

d

d-1

1

Paley graph

p

(q-1)/2

(sqrt(q)+1)/2

Examples

(1)

(2)

(3)

(4)

(5)

(6)

(7)

(8)

Compatibility

• 

The GraphTheory[IsRamanujanGraph] command was introduced in Maple 2023.

• 

For more information on Maple 2023 changes, see Updates in Maple 2023.

See Also

Degree

DegreeSequence

IsRegular

 


Download Help Document