Let G=(V,E) be a simple graph. For any real valued function f∶V→R and SV, let f(S)=∑ u∈S?f(u). A majority dominating function is a function f∶V→{-1,1} such that f(N)≥1 for at least half the vertices v∈V. Th...Let G=(V,E) be a simple graph. For any real valued function f∶V→R and SV, let f(S)=∑ u∈S?f(u). A majority dominating function is a function f∶V→{-1,1} such that f(N)≥1 for at least half the vertices v∈V. Then majority domination number of a graph G is γ maj(G)=min{f(V)|f is a majority dominating function on G}. We obtain lower bounds on this parameter and generalize some results of Henning.展开更多
In this paper, we study the stability of discrete linear singular systems by switching controller. Using some recent results on multiple-Lyapunov function technique, we obtain two sufficient conditions of linear singu...In this paper, we study the stability of discrete linear singular systems by switching controller. Using some recent results on multiple-Lyapunov function technique, we obtain two sufficient conditions of linear singular systems.展开更多
文摘Let G=(V,E) be a simple graph. For any real valued function f∶V→R and SV, let f(S)=∑ u∈S?f(u). A majority dominating function is a function f∶V→{-1,1} such that f(N)≥1 for at least half the vertices v∈V. Then majority domination number of a graph G is γ maj(G)=min{f(V)|f is a majority dominating function on G}. We obtain lower bounds on this parameter and generalize some results of Henning.
基金Supported by the Young Teacher from Henan Province(2004)
文摘In this paper, we study the stability of discrete linear singular systems by switching controller. Using some recent results on multiple-Lyapunov function technique, we obtain two sufficient conditions of linear singular systems.
