Add to ORKGGiven a complex m n matrix A; we index its singular values as 1 (A) 2 (A) ::: and call the value E (A) = 1 (A)+2 (A)+::: the energy of A; thereby extending the concept of graph energy, introduced by Gutman. Let 2 m n; A be anmn nonnegative matrix with maximum entry , and kAk1 n. Extending previous results of Koolen and Moulton for graphs, we prove that E (A) kAk1p mn vuut(m 1) tr (AA) kAk2
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
AbstractThe energy of a graph/matrix is the sum of the absolute values of its eigenvalues. We invest...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
AbstractGiven a complex m×n matrix A, we index its singular values as σ1(A)⩾σ2(A)⩾⋯ and call the val...
AbstractGiven a complex m×n matrix A, we index its singular values as σ1(A)⩾σ2(A)⩾⋯ and call the val...
Given a complex m × n matrix A, we index its singular values as σ1 (A) ≥ σ2 (A) ≥ ⋯ and call the val...
Given a complex m × n matrix A, we index its singular values as σ1 (A) ≥ σ2 (A) ≥ ⋯ and call the val...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
The energy of a graph is equal to the sum of the absolute values of its eigenvalues. The energy of a...
Given a graph G = (V, E), with respect to a vertex partition we associate a matrix called -matrix a...
AbstractThe energy of a graph is equal to the sum of the absolute values of its eigenvalues. The ene...
AbstractLet G be a graph with n vertices and m edges. Let λ1,λ2,…,λn be the eigenvalues of the adjac...
AbstractLet G be a graph on n vertices, and let λ1,λ2,…,λn be the eigenvalues of a (0,1)-adjacency m...
Let G be a simple undirected graph of order n with vertex set V(G) ={v1, v2, ..., vn}. Let di be the...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
AbstractThe energy of a graph/matrix is the sum of the absolute values of its eigenvalues. We invest...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...
AbstractGiven a complex m×n matrix A, we index its singular values as σ1(A)⩾σ2(A)⩾⋯ and call the val...
AbstractGiven a complex m×n matrix A, we index its singular values as σ1(A)⩾σ2(A)⩾⋯ and call the val...
Given a complex m × n matrix A, we index its singular values as σ1 (A) ≥ σ2 (A) ≥ ⋯ and call the val...
Given a complex m × n matrix A, we index its singular values as σ1 (A) ≥ σ2 (A) ≥ ⋯ and call the val...
In this paper we introduce the concept of maximum degree matrix M(G) of a simple graph G and obtain ...
The energy of a graph is equal to the sum of the absolute values of its eigenvalues. The energy of a...
Given a graph G = (V, E), with respect to a vertex partition we associate a matrix called -matrix a...
AbstractThe energy of a graph is equal to the sum of the absolute values of its eigenvalues. The ene...
AbstractLet G be a graph with n vertices and m edges. Let λ1,λ2,…,λn be the eigenvalues of the adjac...
AbstractLet G be a graph on n vertices, and let λ1,λ2,…,λn be the eigenvalues of a (0,1)-adjacency m...
Let G be a simple undirected graph of order n with vertex set V(G) ={v1, v2, ..., vn}. Let di be the...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. ...
AbstractThe energy of a graph/matrix is the sum of the absolute values of its eigenvalues. We invest...
AbstractGiven a graph G, its energyE(G) is defined as the sum of the absolute values of the eigenval...