Displaying 61 – 80 of 147

Showing per page

On some properties of the Laplacian matrix revealed by the RCM algorithm

Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa, Alberto Palomares (2016)

Czechoslovak Mathematical Journal

In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a...

On the binary system of factors of formal matrix rings

Weining Chen, Guixin Deng, Huadong Su (2020)

Czechoslovak Mathematical Journal

We investigate the formal matrix ring over R defined by a certain system of factors. We give a method for constructing formal matrix rings from non-negative integer matrices. We also show that the principal factor matrix of a binary system of factors determine the structure of the system.

On the cardinality of complex matrix scalings

George Hutchinson (2016)

Special Matrices

We disprove a conjecture made by Rajesh Pereira and Joanna Boneng regarding the upper bound on the number of doubly quasi-stochastic scalings of an n × n positive definite matrix. In doing so, we arrive at the true upper bound for 3 × 3 real matrices, and demonstrate that there is no such bound when n ≥ 4.

Currently displaying 61 – 80 of 147