Nodal Domain Theorems and Bipartite Subgraphs

Türker Biyikoglu, Josef Leydold, Peter F. Stadler

Publication: Working/Discussion Paper › WU Working Paper

7 Downloads (Pure)

Abstract

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor. (author's abstract)
Original languageEnglish
Place of PublicationVienna
PublisherDepartment of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business
Publication statusPublished - 2005

Publication series

NamePreprint Series / Department of Applied Statistics and Data Processing
No.55

WU Working Paper Series

  • Preprint Series / Department of Applied Statistics and Data Processing

Access to Document

  • DocumentFinal published version, 280 KBLicence: Other

Check availability

University Library Catalogue
    • 1 Journal article

    Cite this