Graphs with magnetic Schrödinger operators of low corank

H. Holst, van der

    Research output: Contribution to journalArticleAcademicpeer-review

    13 Citations (Scopus)

    Abstract

    Colin de Verdière (1998, J. Combin. Theory, Ser. B.74, 121–146) introduced the graph parameter ¿(G), which is defined as the maximal corank of any positive semidefinite magnetic Schrödinger operator fulfilling a certain transversality condition. He showed that for connected simple graphs, ¿(G)1 if and only if G is a tree. In this paper we characterize for k=2, 3, the classes of graphs G with ¿(G)k.
    Original languageEnglish
    Pages (from-to)311-339
    JournalJournal of Combinatorial Theory, Series B
    Volume84
    Issue number2
    DOIs
    Publication statusPublished - 2002

    Fingerprint

    Dive into the research topics of 'Graphs with magnetic Schrödinger operators of low corank'. Together they form a unique fingerprint.

    Cite this