Results 51 to 60 of about 2,183 (141)
On $k$-circulant matrices involving the Fibonacci numbers
Let k be a nonzero complex number. In this paper we consider a k-circulant matrix whose first row is .F1;F2; : : : ;Fn/, where Fn is the nth Fibonacci number, and investigate the eigenvalues and Euclidean (or Frobenius) norm of that matrix.
Biljana Radičić
semanticscholar +1 more source
On the minimum spectral radius of connected graphs of given order and size
In this article, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size.
Cioaba Sebastian M. +2 more
doaj +1 more source
Some inequalities on the skew-spectral radii of oriented graphs
Let G be a simple graph and Gσ be an oriented graph obtained from G by assigning a direction to each edge of G. The adjacency matrix of G is A(G) and the skew-adjacency matrix of Gσ is S(Gσ).
Guang-Hui Xu
semanticscholar +1 more source
Matrix approach to the Shapley value and dual similar associated consistency [PDF]
Replacing associated consistency in Hamiache's axiom system by dual similar associated consistency, we axiomatize the Shapley value as the unique value verifying the inessential game property, continuity and dual similar associated consistency ...
G. Xuand +3 more
core +2 more sources
More on the minimum skew-rank of graphs
The minimum (maximum) skew-rank of a simple graph G over real field is the smallest (largest) possible rank among all skew-symmetric matrices over real field whose i j -th entry is nonzero whenever viv j is an edge in G and is zero otherwise.
Hui Qu, Guihai Yu, Linhua Feng
semanticscholar +1 more source
How to determine the eigenvalues of g-circulant matrices
For a given nonnegative integer g, a matrix Cn,g of size n is called g -circulant if Cn,g = [a(r−gs)modn]n−1 r,s=0 . Such matrices arise in wavelet analysis, subdivision algorithms, and more generally when dealing with multigrid/multilevel methods for ...
Eric Ngondiep
semanticscholar +1 more source
Inequalities for certain powers of positive definite matrices
Let A,B, and X be n× n matrices such that A,B are positive definite and X is Hermitian. If a and b are real numbers such that 0 < a sn (A) and 0 < b sn (B) , then it is shown, among other inequalities, that ∣ ∣ ∣ ∣ ∣ ∣ ∣ ∣ ∣AX +XBa ∣ ∣ ∣ ∣ ∣ ∣ ∣ ∣ ∣ (1 ...
Fadi Alrimawi +2 more
semanticscholar +1 more source
Changes in signature induced by the Lyapunov mapping LA : X → AX + XAA±
International Journal of Mathematics and Mathematical Sciences, Volume 12, Issue 3, Page 503-506, 1989.
Tyler Haynes
wiley +1 more source
Bordering method to compute Core-EP inverse
Following the work of Kentaro Nomakuchi[10] and Manjunatha Prasad et.al., [7] which relate various generalized inverses of a given matrix with suitable bordering,we describe the explicit bordering required to obtain core-EP inverse, core-EP generalized ...
Prasad K. Manjunatha, Raj M. David
doaj +1 more source
Inequalities for certain powers of several positive definite matrices
Let Ai, i = 1, ...,m, and X be n×n matrices such that each Ai is positive definite with 0 < ai sn (Ai) and X is Hermitian. Then it is shown that ∣∣∣∣ ∣∣∣∣ ∣∣∣∣ ( m ∑ i=1 A am+1−i i ) X +X ( m ∑ i=1 Ai m+1−i ∣∣∣∣ ∣∣∣∣ ∣∣∣∣ m(1+ l2) |||X ||| , for every ...
Fadi Alrimawi
semanticscholar +1 more source

