@techreport{19ea6f94e851430a9a69e1e2ab90658b,

title = "A Discrete Nodal Domain Theorem for Trees",

abstract = "Let G be a connected graph with n vertices and let x=(x1, ..., xn) be a real vector. A positive (negative) sign graph of the vector x is a maximal connected subgraph of G on vertices xi>0 (xi<0). For an eigenvalue of a generalized Laplacian of a tree: We characterize the maximal number of sign graphs of an eigenvector. We give an O(n2) time algorithm to find an eigenvector with maximum number of sign graphs and we show that finding an eigenvector with minimum number of sign graphs is an NP-complete problem. (author's abstract)",

author = "T{\"u}rker Biyikoglu",

year = "2002",

language = "English",

series = "Preprint Series / Department of Applied Statistics and Data Processing",

publisher = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",

number = "43",

edition = "January/May 2002",

type = "WorkingPaper",

institution = "Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business",

}