Bounds on Laplacian eigenvalues related to total and signed domination of graphs
A total dominating set in a graph is a subset of such that each vertex of is adjacent to at least one vertex of . The total domination number of is the minimum cardinality of a total dominating set. A function is a signed dominating function (SDF) if the sum of its function values over any closed neighborhood is at least one. The weight of an SDF is the sum of its function values over all vertices. The signed domination number of is the minimum weight of an SDF on . In this paper...