Ditroid is a directed version of matroid. In this paper we investigate transversal theory of ditroids. Directed versions of Rado-Hall and Edmonds-Fulkerson theorems are obtained. Our results provide partial answers to...Ditroid is a directed version of matroid. In this paper we investigate transversal theory of ditroids. Directed versions of Rado-Hall and Edmonds-Fulkerson theorems are obtained. Our results provide partial answers to two questions raised by L. Qi.展开更多
The consensus problem for general linear multi-agent systems （MASs） under directed topology is investigated. First, a novel consensus protocol based on proportional-integral-derivative （PID） control is proposed. S...The consensus problem for general linear multi-agent systems （MASs） under directed topology is investigated. First, a novel consensus protocol based on proportional-integral-derivative （PID） control is proposed. Second, the consensus problem is converted into an asymptotic stability problem through transformations. Third, through a state projection method the consensus condition is proved and the explicit expression of the consensus function is given. Then, a Lyapunov function is constructed and the gain matrices of the protocol are given based on the linear matrix inequality. Finally, two experiments are conducted to explain the advantages of the method. Simulation results show the effectiveness of the proposed algorithm.展开更多
A digraph D（V, E） is said to be graceful if there exists an injection f ： V（G） →{0, 1,... , ｜E｜} such that the induced function f＇ ： E（G） --~ {1, 2,… , ｜E｜} which is defined by f＇ （u, v） = [f（v） - ...A digraph D（V, E） is said to be graceful if there exists an injection f ： V（G） →{0, 1,... , ｜E｜} such that the induced function f＇ ： E（G） --~ {1, 2,… , ｜E｜} which is defined by f＇ （u, v） = [f（v） - f（u）] （rood ｜E｜＋ 1） for every directed edge （u, v） is a bijection. Here, f is called a graceful labeling （graceful numbering） of D（V, E）, while f＇ is called the induced edge＇s graceful labeling of D. In this paper we discuss the gracefulness of the digraph n- Cm and prove that n. Cm is a graceful digraph for m = 15, 17 and even展开更多
文摘Ditroid is a directed version of matroid. In this paper we investigate transversal theory of ditroids. Directed versions of Rado-Hall and Edmonds-Fulkerson theorems are obtained. Our results provide partial answers to two questions raised by L. Qi.
基金Project supported by the National Natural Science Foundation of China （No. 50875132）
文摘The consensus problem for general linear multi-agent systems （MASs） under directed topology is investigated. First, a novel consensus protocol based on proportional-integral-derivative （PID） control is proposed. Second, the consensus problem is converted into an asymptotic stability problem through transformations. Third, through a state projection method the consensus condition is proved and the explicit expression of the consensus function is given. Then, a Lyapunov function is constructed and the gain matrices of the protocol are given based on the linear matrix inequality. Finally, two experiments are conducted to explain the advantages of the method. Simulation results show the effectiveness of the proposed algorithm.
文摘A digraph D（V, E） is said to be graceful if there exists an injection f ： V（G） →{0, 1,... , ｜E｜} such that the induced function f＇ ： E（G） --~ {1, 2,… , ｜E｜} which is defined by f＇ （u, v） = [f（v） - f（u）] （rood ｜E｜＋ 1） for every directed edge （u, v） is a bijection. Here, f is called a graceful labeling （graceful numbering） of D（V, E）, while f＇ is called the induced edge＇s graceful labeling of D. In this paper we discuss the gracefulness of the digraph n- Cm and prove that n. Cm is a graceful digraph for m = 15, 17 and even
