On bipartite graphs with small number of laplacian eigenvalues greater than two and three (Q4498327)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1491666
Language Label Description Also known as
default for all languages
No label defined
    English
    On bipartite graphs with small number of laplacian eigenvalues greater than two and three
    scientific article; zbMATH DE number 1491666

      Statements

      On bipartite graphs with small number of laplacian eigenvalues greater than two and three (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      16 July 2001
      0 references
      bipartite graphs
      0 references
      Laplacian eigenvalues
      0 references
      Let \(L(\lambda, k)\) be the set of connected bipartite graphs with exactly \(k\) Laplacian eigenvalues greater than \(\lambda\). The sets \(L(2,2)\) and \(L(3,1)\) are determined. In both cases we get infinite sequences of graphs and a finite number of exceptional graphs with a small number of vertices.
      0 references

      Identifiers