Ladder

Graph invariant — the ladder

One essay so far against this idea. A ladder is the distinct arguments that stand against one idea, and this one has room to grow.
  1. a triangle and a square, joinedK₂,₃ with a pendant edge1234560123456indexeigenvaluethe same, and not the samevertices each6edges each7spanning trees12spectra differ by5.3·10⁻¹⁵highest degree, left4highest degree, right3one has a trianglethe other is bipartite

    The spectrum is not the graph

    Two graphs on six vertices with the same Laplacian characteristic polynomial — as integer polynomials, not to fourteen digits. One contains a triangle; the other is bipartite. Every method in this field that reads only the spectrum is answering about the class.

    rung 1 · graph

All ladders