The SeidelSpectrum command returns the Seidel spectrum of the eigenvalues of a specified graph. That is the set of eigenvalues of the matrix J−I−2⁢A 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.
G≔Graph 1: an undirected unweighted graph with 16 vertices and 40 edge(s)
P≔Graph 2: an undirected unweighted graph with 10 vertices and 15 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)