Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
In this paper, we consider the problem of network deployment in hybrid sensor networks, consisting of both resource-rich and resource-impoverished sensor devices. The resource-ric...
Wen Hu, Chun Tung Chou, Sanjay Jha, Nirupama Bulus...
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
A controller change from a current controller which stabilises the plant to a new controller, designed on the basis of an approximate model of the plant and with guaranteed bounds...
A. Lecchini, Alexander Lanzon, Brian D. O. Anderso...
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...