GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/SeidelSpectrum

GraphTheory

  

SeidelSpectrum

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

SeidelSpectrum(G)

Parameters

G

-

graph

Description

• 

The SeidelSpectrum command returns the Seidel spectrum of the eigenvalues of a specified graph. That is the set of eigenvalues of the matrix JI2A where J is the all-one matrix, I is the identity matrix and A is the adjacency matrix of the graph. The output is a list L. Each element of L is a list of size 2, where the first element is an eigenvalue and the second element is its multiplicity.

Examples

withGraphTheory:

withSpecialGraphs:

GClebschGraph

GGraph 1: an undirected unweighted graph with 16 vertices and 40 edge(s)

(1)

SeidelSpectrumG

−3,10,5,6

(2)

PPetersenGraph

PGraph 2: an undirected unweighted graph with 10 vertices and 15 edge(s)

(3)

SeidelSpectrumP

−3,5,3,5

(4)

See Also

AdjacencyMatrix

GraphSpectrum