Sharif Digital Repository

Interactive vibrations and buckling of double current-carrying strips (DCCS) are investigated in this study. Considering the rotational and transverse deformation of the strip, four coupled equations of motion are obtained using Hamilton’s principle. Using the Galerkin method, mass and stiffness matrices are extracted and the stability of the system is determined by solving the eigenvalue problem. Effects of pretension and elevated temperature on the stability of DCCS are studied for three types of materials and various arrangements. Finally, the effect of horizontal or vertical distance between strips on the critical current value is investigated. According to the results, the effects of... 

This study attempts to reach a broad understanding of the stability properties of nonlinear time-periodic flapping wing structures. Two bio-system models, Hummingbird (6DOF) and Hawkmoth (3DOF) are developed for this purpose. Initial analysis on the Hummingbird model, which is based on the Floquet theory, kinetic energy integration, and phase portrait technique, indicates lack of stability in hover flight. Kinetic energy integration is carried out on the extended model of the Hawkmoth to find the domain of attraction and increase the level of stability by varying the design parameters. Here, the hinge location of the wing, flapping amplitude, flapping frequency, and mean angle of attack are... 

The eigenvalue perturbation theorem is used to propose a convex fragility criterion with application to control system design. The criterion can be considered as a non-normality measure of the controller state-space matrix. Non-normality of a matrix is defined as its distance to the nearest real normal matrix within a convex normal subspace. Based on the criterion, an H∞ method for the order reduction of linear time-invariant (LTI) controllers is developed which leads to non-fragile reduced order controllers. 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission  

The free linear vibration of an adaptive sandwich beam consisting of a frequency and field-dependent magnetorheological fluid core and an axially functionally graded constraining layer is investigated. The Euler-Bernoulli and Timoshenko beam theories are utilized for defining the longitudinal and lateral deformation of the sandwich beam. The Rayleigh-Ritz method is used to derive the frequency-dependent eigenvalue problem through the kinetic and strain energy expressions of the sandwich beam. In order to deal with the frequency dependency of the core, the approached complex eigenmodes method is implemented. The validity of the formulation and solution method is confirmed through comparison... 

This paper is concerned with the tele-operation of autonomous vehicles over analog Additive White Gaussian Noise (AWGN) channel, which is subject to transmission noise and power constraint. The nonlinear dynamic of autonomous vehicles is described by the unicycle model and is cascaded with a bandpass filter acting as encoder. Using the describing function method, the nonlinear dynamic of autonomous vehicles is represented by an approximate linear system. Then, the available results for linear control over analog AWGN channel are extended to account for linear continuous time systems with non-real valued and multiple real valued eigenvalues and for tracking a non-zero reference signal.... 

For a graph G, let (Formula presented.) denote its second smallest Laplacian eigenvalue. It was conjectured that (Formula presented.), where (Formula presented.) is the complement of G. In this paper, it is shown that (Formula presented.). © 2019 Informa UK Limited, trading as Taylor & Francis Group  

In our previous report (J. Phys. Org. Chem., 2017), we discussed the dual behavior of gold nanocluster (Au3 NC), where it scavenged reactive oxygen species (ROS) while promoted their generation to a lesser extent. Continuing this quest, we investigate the effects of Au3 NC on common reactive nitrogen species (RNS: O=N˙ and O=N-O) and their precursors (O=N-H and O=N-O-H, respectively), at B3LYP/LACVP+* level of theory. We compare the results with those of prevalent ROS (H-O˙ and H-O-O˙) and their precursors (H-O-H and H-O-O-H, respectively). To this end, various parameters are probed such as binding energy (Eb), bond dissociation energy (BDE), bond lengths, Mullikan spin density (MSD),... 

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  

For a graph G, let (Formula presented.) denote its second smallest Laplacian eigenvalue. It was conjectured that (Formula presented.), where (Formula presented.) is the complement of G. In this paper, it is shown that (Formula presented.). © 2019 Informa UK Limited, trading as Taylor & Francis Group  

In our previous report (J. Phys. Org. Chem., 2017), we discussed the dual behavior of gold nanocluster (Au3 NC), where it scavenged reactive oxygen species (ROS) while promoted their generation to a lesser extent. Continuing this quest, we investigate the effects of Au3 NC on common reactive nitrogen species (RNS: O=N˙ and O=N-O) and their precursors (O=N-H and O=N-O-H, respectively), at B3LYP/LACVP+* level of theory. We compare the results with those of prevalent ROS (H-O˙ and H-O-O˙) and their precursors (H-O-H and H-O-O-H, respectively). To this end, various parameters are probed such as binding energy (Eb), bond dissociation energy (BDE), bond lengths, Mullikan spin density (MSD),... 

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  

We investigate eigenvectors of rank-one deformations of random matrices boldsymbol B = boldsymbol A + theta boldsymbol {uu}{} in which boldsymbol A in mathbb R{N times N} is a Wigner real symmetric random matrix, theta in mathbb R{+} , and boldsymbol u is uniformly distributed on the unit sphere. It is well known that for theta > 1 the eigenvector associated with the largest eigenvalue of boldsymbol B closely estimates boldsymbol u asymptotically, while for theta < 1 the eigenvectors of boldsymbol B are uninformative about boldsymbol u. We examine mathcal O({1}/{N}) correlation of eigenvectors with boldsymbol u before phase transition and show that eigenvectors with larger eigenvalue exhibit... 

Synchronization among a set of networked nodes has attracted much attention in different fields. This paper thoroughly investigates linear formulation of the Kuramoto model, with and without frustration, for an arbitrarily weighted undirected network where all nodes may have different intrinsic frequencies. We develop a mathematical framework to estimate errors of the linear approximation for globally and locally coupled networks. We mathematically prove that the eigenvector corresponding to the largest eigenvalue of the network's Laplacian matrix is enough for examining synchrony alignment and that the functionality of this vector depends on the corresponding eigenvalue. Moreover, we prove... 

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