Sharif Digital Repository

The singular values of a matrix A are defined as the square roots of the eigenvalues of A⁎A, and the energy of A denoted by E(A) is the sum of its singular values. The energy of a graph G, E(G), is defined as the sum of absolute values of the eigenvalues of its adjacency matrix. In this paper, we prove that if A is a Hermitian matrix with the block form A=(BDD⁎C), then E(A)≥2E(D). Also, we show that if G is a graph and H is a spanning subgraph of G such that E(H) is an edge cut of G, then E(H)≤E(G), i.e., adding any number of edges to each part of a bipartite graph does not decrease its energy. Let G be a connected graph of order n and size m with the adjacency matrix A. It is well-known... 

In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound [Formula presented], and emphasize the particular role of the algebraic connectivity. © 2019 Elsevier Inc  

Let G be a graph with vertex set (Formula presented.) and (Formula presented.) be an (Formula presented.) matrix whose (Formula presented.) -entry is the maximum number of internally edge-disjoint paths between (Formula presented.) and (Formula presented.), if (Formula presented.), and zero otherwise. Also, define (Formula presented.), where D is a diagonal matrix whose i-th diagonal element is the number of edge-disjoint cycles containing (Formula presented.), whose (Formula presented.) is a multiple of J−I. Among other results, we determine the spectrum and the energy of the matrix (Formula presented.) for an arbitrary bicyclic graph G. © 2020 Informa UK Limited, trading as Taylor &... 

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

The energy of a graph G, denoted by E (G), is defined as the sum of the absolute values of all eigenvalues of the adjacency matrix of G. It is proved that E (G) ≥ 2 (n - χ (over(G, -))) ≥ 2 (ch (G) - 1) for every graph G of order n, and that E (G) ≥ 2 ch (G) for all graphs G except for those in a few specified families, where over(G, -), χ (G), and ch (G) are the complement, the chromatic number, and the choice number of G, respectively. © 2007 Elsevier Inc. All rights reserved  

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. This concept was extended by Nikiforov to arbitrary complex matrices. Recall that the trace norm of a digraph D is defined as, N(D)=∑i=1nσi, where σ1≥⋯≥σn are the singular values of the adjacency matrix of D. In this paper we would like to present some lower and upper bounds for N(D). For any digraph D it is proved that N(D)≥rank(D) and the equality holds if and only if D is a disjoint union of directed cycles and directed paths. Finally, we present a lower bound on σ1 and N(D) in terms of the size of digraph D. © 2021 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours. The children GA and GB of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in GA or GB if and only if they have a or b common neighbours, respectively. A strongly Deza graph is a Deza graph with strongly regular children. In this paper we give a spectral characterisation of strongly Deza graphs, show relationships between eigenvalues, and study strongly Deza graphs which are distance-regular. © 2021 Elsevier B.V  

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. This concept was extended by Nikiforov to arbitrary complex matrices. Recall that the trace norm of a digraph D is defined as, N(D)=∑i=1nσi, where σ1≥⋯≥σn are the singular values of the adjacency matrix of D. In this paper we would like to present some lower and upper bounds for N(D). For any digraph D it is proved that N(D)≥rank(D) and the equality holds if and only if D is a disjoint union of directed cycles and directed paths. Finally, we present a lower bound on σ1 and N(D) in terms of the size of digraph D. © 2021 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

Let F be an algebraically closed field and T: Mn(F) → Mn(F) be a linear transformation. In this paper we show that if T preserves at least one eigenvalue of each matrix, then T preserves all eigenvalues of each matrix. Moreover, for any infinite field F (not necessarily algebraically closed) we prove that if T: Mn(F) → M n(F) is a linear transformation and for any A ∈ Mn(F) with at least an eigenvalue in F, A and T(A) have at least one common eigenvalue in F, then T preserves the characteristic polynomial  

The energy of a graph G, E(G), is defined as the sum of absolute values of the eigenvalues of its adjacency matrix. In Akbari and Hosseinzadeh (2020) [3] it was conjectured that for every graph G with maximum degree Δ(G) and minimum degree δ(G) whose adjacency matrix is non-singular, E(G)≥Δ(G)+δ(G) and the equality holds if and only if G is a complete graph. Let G be a connected graph with the edge set E(G). In this paper, first we show that E(L(G))≥|E(G)|+Δ(G)−5, where L(G) denotes the line graph of G. Next, using this result, we prove the validity of the conjecture for the line of each connected graph of order at least 7. © 2021 Elsevier Inc  

Let G be a graph with vertex set (Formula presented.) and (Formula presented.) be an (Formula presented.) matrix whose (Formula presented.) -entry is the maximum number of internally edge-disjoint paths between (Formula presented.) and (Formula presented.), if (Formula presented.), and zero otherwise. Also, define (Formula presented.), where D is a diagonal matrix whose i-th diagonal element is the number of edge-disjoint cycles containing (Formula presented.), whose (Formula presented.) is a multiple of J−I. Among other results, we determine the spectrum and the energy of the matrix (Formula presented.) for an arbitrary bicyclic graph G. © 2020 Informa UK Limited, trading as Taylor &... 

The potentials of carbon nanotubes (CNTs) as mechanical resonators for atomic-scale mass sensing are presented. To this aim, a nonlocal continuum-based model is proposed to study the dynamic behavior of bridged single-walled carbon nanotube-based mass nanosensors. The carbon nanotube (CNT) is considered as an elastic Euler–Bernoulli beam with von Kármán type geometric nonlinearity. Eringen’s nonlocal elastic field theory is utilized to model the interatomic long-range interactions within the structure of the CNT. This developed model accounts for the arbitrary position of the deposited atomic-mass. The natural frequencies and associated mode shapes are determined based on an eigenvalue... 

A nonlocal continuum-based model is derived to simulate the dynamic behavior of bridged carbon nanotube-based nano-scale mass detectors. The carbon nanotube (CNT) is modeled as an elastic Euler-Bernoulli beam considering von-Kármán type geometric nonlinearity. In order to achieve better accuracy in characterization of the CNTs, the geometrical properties of an attached nano-scale particle are introduced into the model by its moment of inertia with respect to the central axis of the beam. The inter-atomic long-range interactions within the structure of the CNT are incorporated into the model using Eringen's nonlocal elastic field theory. In this model, the mass can be deposited along an... 

In this paper, the vibration of a moderately thick plate to a moving mass is investigated. Pasternak foundation with a variable subgrade modulus is considered to tackle the shortcomings of Winkler model, and an analytical-numerical solution is proposed based on the eigenfunction expansion method. Parametric studies by using both CPT (Classical Plate Theory) and FSDT (First-Order Shear Deformation Plate Theory) are carried out, and, the differences between them are also highlighted. The obtained results reveal that utilizing FSDT without considering the rotary inertia leads to a smaller deflection in comparison with CPT pertaining to a thin plate, while it demonstrates a greater response for... 

The problem of designing UWB pulses which meet specific spectrum requirements is usually treated by filtering common pulses such as Gaussian doublets, modified Hermite polynomials and wavelets. When there is the need to have a number of orthogonal pulses (e.g., in a multiuser scenario), a naive approach is to filter all the members of an orthogonal set, which is likely to destroy their orthogonality property. In this paper, we study the design of a set of pulses that simultaneously satisfy the orthogonality property and spectrum requirements. Our design is based on the eigenfunctions of Sturm–Liouville boundary value problems. Indeed, we introduce Sturm–Liouville differential equations for... 

Integrating high spatial resolution of functional magnetic resonance imaging (fMRI) and high temporal resolution of electroencephalogram (EEG) is promising in simultaneous EEG and fMRI analysis, especially for epileptic patients. The EEG recorded inside an MR scanner is interfered with MR artifacts. In this article, we propose new artifact reduction approaches and compare them with the conventional artifact reduction methods. Our proposed approaches are based on generalized eigenvalue decomposition (GEVD) and median filtering. The proposed methods are applied on experimental simultaneous EEG and fMRI recordings of an epileptic patient. The results show significant improvement over... 

In this paper we present a method for transient analysis of availability and survivability of a system with the identical components and identical repairmen. The considered system is supposed to consist of series of k-out-of-n or parallel components. We employed the Markov models, eigen vectors and eigenvalues for analyzing the transient availability and survivability of the system. The method is implemented through an algorithm which is tested in MATLAB programming environment. The new method enjoys a stronger mathematical foundation and more flexibility for analyzing the transient availability and survivability of the system. © 2006 Elsevier Inc. All rights reserved  

In this paper, the Markov models, eigenvectors and eigenvalue concepts are used to propose a methodology for analyzing the transient reliability of a system with identical components and identical repairmen. The components of the systems under consideration can have two distinct configurations, namely; they can be arranged in series or in parallel. A third case is also considered, in which the system is up (good) if k-out-of-n components are good. For all three cases, a procedure is proposed for calculating the transient probability of the system availability and the duration of the system to reach the steady state. © Sharif University of Technology, February 2007