All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 8 Next

Displaying 141 – 160 of 256

Showing per page

On network models and the symbolic solution of network equations

Kurt Reinschke (2001)

International Journal of Applied Mathematics and Computer Science

This paper gives an overview of the formulation and solution of network equations, with emphasis on the historical development of this area. Networks are mathematical models. The three ingredients of network descriptions are discussed. It is shown how the network equations of one-dimensional multi-port networks can be formulated and solved symbolically. If necessary, the network graph is modified so as to obtain an admittance representation for all kinds of multi-ports. N-dimensional networks are...

On quadratic Hurwitz forms. I

Jiří Gregor (1981)

Aplikace matematiky

Homogeneous quadratic polynomials f in n complex variables are investigated and various necessary and sufficient conditions are given for f to be nonzero in the set Γ ( n ) = z ∈ C ( n ) : R e z > 0 . Conclusions for the theory of multivariable positive real functions are formulated with applications in multivariable electrical network theory.

On robust consensus of multi-agent systems with communication delays

Jiangping Hu (2009)

Kybernetika

In this paper, two robust consensus problems are considered for a multi-agent system with various disturbances. To achieve the robust consensus, two distributed control schemes for each agent, described by a second-order differential equation, are proposed. With the help of graph theory, the robust consensus stability of the multi-agent system with communication delays is obtained for both fixed and switching interconnection topologies. The results show the leaderless consensus can be achieved with...

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models

Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener (2010)

RAIRO - Theoretical Informatics and Applications

Ordered binary decision diagrams (OBDDs) and several more general BDD models have turned out to be representations of Boolean functions which are useful in applications like verification, timing analysis, test pattern generation or combinatorial optimization. The hidden weighted bit function (HWB) is of particular interest, since it seems to be the simplest function with exponential OBDD size. The complexity of this function with respect to different circuit models, formulas, and various...

On the computational complexity of centers locating in a graph

Ján Plesník (1980)

Aplikace matematiky

It is shown that the problem of finding a minimum k -basis, the n -center problem, and the p -median problem are N P -complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal m -center problem is also N P -complete.

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao, Minyong Shi, Lihua Feng (2016)

Discussiones Mathematicae Graph Theory

The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn is edge-hy per-...

Currently displaying 141 – 160 of 256