Skip to main content
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link
  • On n-vertices, how many isospectral graphs exist?

[..I saw this previous "historic" discussion between two of the stalwarts in this field - httphttps://mathoverflow.net/questions/83817/operation-on-isospectral-graphs ]

  • Given a graph are these ways to generate other graphs from it which have the same spectrum as the first one but will necessarily be non-isomorphic? (...if one considers weighted graphs then are two graphs with different weights but same connectivity considered isomorphic?...)
  • On n-vertices, how many isospectral graphs exist?

[..I saw this previous "historic" discussion between two of the stalwarts in this field - http://mathoverflow.net/questions/83817/operation-on-isospectral-graphs ]

  • Given a graph are these ways to generate other graphs from it which have the same spectrum as the first one but will necessarily be non-isomorphic? (...if one considers weighted graphs then are two graphs with different weights but same connectivity considered isomorphic?...)
  • On n-vertices, how many isospectral graphs exist?

[..I saw this previous "historic" discussion between two of the stalwarts in this field - https://mathoverflow.net/questions/83817/operation-on-isospectral-graphs ]

  • Given a graph are these ways to generate other graphs from it which have the same spectrum as the first one but will necessarily be non-isomorphic? (...if one considers weighted graphs then are two graphs with different weights but same connectivity considered isomorphic?...)
Source Link
user6818
  • 1.9k
  • 12
  • 20

Can we count isospectral graphs?

  • On n-vertices, how many isospectral graphs exist?

[..I saw this previous "historic" discussion between two of the stalwarts in this field - http://mathoverflow.net/questions/83817/operation-on-isospectral-graphs ]

  • Given a graph are these ways to generate other graphs from it which have the same spectrum as the first one but will necessarily be non-isomorphic? (...if one considers weighted graphs then are two graphs with different weights but same connectivity considered isomorphic?...)