A new inequality on the minimum eigenvalue for the Fan product of nonsingular M-matrices is given. In addition, a new inequality on the spectral radius of the Hadamard product of nonnegative matrices is also obtained....A new inequality on the minimum eigenvalue for the Fan product of nonsingular M-matrices is given. In addition, a new inequality on the spectral radius of the Hadamard product of nonnegative matrices is also obtained. These inequalities can improve considerably some previous results.展开更多
Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This p...Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.展开更多
Through the real representations of quaternion matrices and matrix rank method, we give the expression of the real ma-trices in least-squares g-inverse and minimum norm g-inverse. From these formulas, we derive the ex...Through the real representations of quaternion matrices and matrix rank method, we give the expression of the real ma-trices in least-squares g-inverse and minimum norm g-inverse. From these formulas, we derive the extreme ranks of the real matrices. As applications, we establish necessary and sufficient conditions for some special least-squares g-inverse and minimum norm g-inverse.展开更多
文摘A new inequality on the minimum eigenvalue for the Fan product of nonsingular M-matrices is given. In addition, a new inequality on the spectral radius of the Hadamard product of nonnegative matrices is also obtained. These inequalities can improve considerably some previous results.
文摘Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.
文摘Through the real representations of quaternion matrices and matrix rank method, we give the expression of the real ma-trices in least-squares g-inverse and minimum norm g-inverse. From these formulas, we derive the extreme ranks of the real matrices. As applications, we establish necessary and sufficient conditions for some special least-squares g-inverse and minimum norm g-inverse.
