Displaying 441 – 460 of 2599

Showing per page

Bounds on Laplacian eigenvalues related to total and signed domination of graphs

Wei Shi, Liying Kang, Suichao Wu (2010)

Czechoslovak Mathematical Journal

A total dominating set in a graph G is a subset X of V ( G ) such that each vertex of V ( G ) is adjacent to at least one vertex of X . The total domination number of G is the minimum cardinality of a total dominating set. A function f : V ( G ) { - 1 , 1 } 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 G is the minimum weight of an SDF on G . In this paper...

Bounds on the subdominant eigenvalue involving group inverses with applications to graphs

Stephen J. Kirkland, Neumann, Michael, Bryan L. Shader (1998)

Czechoslovak Mathematical Journal

Let A be an n × n symmetric, irreducible, and nonnegative matrix whose eigenvalues are λ 1 > λ 2 ... λ n . In this paper we derive several lower and upper bounds, in particular on λ 2 and λ n , but also, indirectly, on μ = max 2 i n | λ i | . The bounds are in terms of the diagonal entries of the group generalized inverse, Q # , of the singular and irreducible M-matrix Q = λ 1 I - A . Our starting point is a spectral resolution for Q # . We consider the case of equality in some of these inequalities and we apply our results to the algebraic connectivity of undirected...

Calculation of industrial robot trajectory in frame composite production

Mlýnek, Jaroslav, Martinec, Tomáš, Petrů, Michal (2017)

Programs and Algorithms of Numerical Mathematics

This article is focused on calculating the trajectory of an industrial robot in the production of composites for the automotive industry. The production technology is based on the winding of carbon fibres on a polyurethane frame. The frame is fastened to the end-effector of the robot arm (i.e. robot-end-effector, REE). The passage of the frame through the fibre processing head is determined by the REE trajectory. The position of the fibre processing head is fixed and is composed of three fibre guide...

Calculation of the greatest common divisor of perturbed polynomials

Zítko, Jan, Eliaš, Ján (2013)

Programs and Algorithms of Numerical Mathematics

The coefficients of the greatest common divisor of two polynomials f and g (GCD ( f , g ) ) can be obtained from the Sylvester subresultant matrix S j ( f , g ) transformed to lower triangular form, where 1 j d and d = deg(GCD ( f , g ) ) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of S j ( f , g ) for an arbitrary allowable j are in details described and an algorithm for the calculation of the GCD ( f , g ) is formulated. If inexact polynomials are given, then an approximate greatest...

Currently displaying 441 – 460 of 2599