Resource title

Nodal Domain Theorems and Bipartite Subgraphs

Resource image

image for OpenScout resource :: Nodal Domain Theorems and Bipartite Subgraphs

Resource description

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) ; Series: Preprint Series / Department of Applied Statistics and Data Processing

Resource author

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

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://epub.wu.ac.at/626/1/document.pdf

Resource license

Adapt according to the license agreement. Always reference the original source and author.