On the Signless Laplacian Spectral Radius of C4-free k-cyclic Graphs

A k-cyclic graph is a connected graph of order n and size n + k-1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C_4-free k-cyclic graphs of order n. Furthermore, we determine the first three unicycles and bicyclic, C_4-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the(combinatorial)

On the Spectral Radius of Trees with the Given Diameter d

Let T denote a tree with the diameter d(d≥2) and order n. Let Pd,r,n-d-1 denote the tree obtained by identifying the rth vertex of path Pd+1 and the center of star K1,n-d-1, where r = r(d) is the integer part about d+2/2. Then p(T) ≤p(Pd,r,n-d-1),and equality holds if and only if T≌ Pd,r,n-d-1

On the Laplacian Spectral Radius of Trees

Some sharp upper bounds of Laplacian spectral radius of trees in terms of order,diameter,pendant vertex number,covering number,edge covering number or total independence number are given.And the ninth to thirteenth largest values of Laplacian spectral radius over the class of trees on a given order are also given.

On the Maximum Spectral Radius of (m,n)-trees with Given Diameter

Let （V, U） be the vertex-partition of tree T as a bipartite graph. T is called an （m, n）-tree if ｜V｜ = m and ｜U｜ = n. For given positive integers m, n and d, the maximum spectral radius of all （m, n）-trees on diameter d are obtained, and all extreme graphs are determined.

Bipartite Graphs with the First and Second Largest Laplacian Spectral Radius

Let Bn^k be the class of bipartite graphs with n vertices and k cut edges. The extremal graphs with the first and the second largest Laplacian spectral radius among all graphs in Bn^K are presented. The bounds of the Laplacian spectral radius of these extremal graphs are also obtained.

Method for Analog Circuit Soft-Fault Diagnosis and Parameter Identification Based on Indictor of Phase Deviation and Spectral Radius

The soft fault induced by parameter variation is one of the most challenging problems in the domain of fault diagnosis for analog circuits.A new fault location and parameter prediction approach for soft-faults diagnosis in analog circuits is presented in this paper.The proposed method extracts the original signals from the output terminals of the circuits under test（CUT） by a data acquisition board.Firstly,the phase deviation value between fault-free and faulty conditions is obtained by fitting the sampling sequence with a sine curve.Secondly,the sampling sequence is organized into a square matrix and the spectral radius of this matrix is obtained.Thirdly,the smallest error of the spectral radius and the corresponding component value are obtained through comparing the spectral radius and phase deviation value with the trend curves of them,respectively,which are calculated from the simulation data.Finally,the fault location is completed by using the smallest error,and the corresponding component value is the parameter identification result.Both simulated and experimental results show the effectiveness of the proposed approach.It is particularly suitable for the fault location and parameter identification for analog integrated circuits.

On the p-norm joint spectral radius

The p-norm joint spectral radius is defined by a bounded collection of square matrices with complex entries and of the same size. In the present paper the author investigates the p-norm joint spectral radius for integers. The method introduced in this paper yields some basic formulas for these spectral radii. The approach used in this paper provides a simple proof of Berger-Wang' s relation concerning the ∞-norm joint spectral radius.

SPECTRAL RADIUSES OF THE GALTON-WATSON BRANCHING PROCESSES

The spectral radiuses of Galton-Watson branching processes which describes the speed of the process escaping from any state are calculated. Under the condition of irreducibility,it is show that this is equal to the spectral radius of Jacobi matrix of its generating function.

A Note on the Spectral Radius of Weighted Signless Laplacian Matrix

A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted graph. In this paper, a brief overview of the notation and concepts of weighted graphs that will be used throughout this study is given. In Section 2, the weighted signless Laplacian matrix of simple connected weighted graphs is considered, some upper bounds for the spectral radius of the weighted signless Laplacian matrix are obtained and some results on weighted and unweighted graphs are found.

Berry-Esseen bounds and moderate deviations for the norm, entries and spectral radius of products of positive random matrices

Let(g_(n))_(n≥1) be a sequence of independent and identically distributed positive random d×d matrices and consider the matrix product G_(n)=g_(n)…g_1.Under suitable conditions,we establish the Berry-Esseen bounds on the rate of convergence in the central limit theorem and Cramer-type moderate deviation expansions,for any matrix norm ‖G_(n)‖ of G_(n),its entries G_(n)^(i,j) and its spectral radius ρ(G_(n)).Extended versions of their joint law with the direction of the random walk G_(n)x are also established,where x is a starting point in the unit sphere of R~d.

A Spectral Radius Condition for a Graph to Have(a,b)-Parity Factors

Let a,b be two positive integers such that a≤b and a≡b(mod 2).We say that a graph G has an(a,b)-parity factor if G has a spanning subgraph F such that dF(v)≡b(mod 2)and a≤dF(v)≤b for all v∈V(G).In this paper,we provide a tight spectral radius condition for a graph to have(a,b)-parity factors.

Sharp Upper and Lower Bounds for the Laplacian Spectral Radius and the Spectral Radius of Graphs

In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius, respectively.

Additive Maps Preserving Nilpotent Operators or Spectral Radius

Let X be a （real or complex） Banach space with dimension greater than 2 and let B0（X） be the subspace of B（X） spanned by all nilpotent operators on X. We get a complete classification of surjective additive maps Ф on B0（X） which preserve nilpotent operators in both directions. In particular, if X is infinite-dimensional, we prove that Ф has the form either Ф（T） = cATA^-1 or Ф（T） = cAT＇A^-1, where A is an invertible bounded linear or conjugate linear operator, c is a scalar, T＇ denotes the adjoint of T. As an application of these results, we show that every additive surjective map on B（X） preserving spectral radius has a similar form to the above with ｜c｜ = 1.

Spectral Radius of Non-negative Matrices and Digraphs

We present,an upper and a lower bound for the spectral radius of non-negative matrices. Then we give the bounds for the spectral radius of digraphs.

Lower Bounds on the(Laplacian) Spectral Radius of Weighted Graphs

The weighted graphs, where the edge weights are positive numbers, are considered. The authors obtain some lower bounds on the spectral radius and the Laplacian spectral radius of weighted graphs, and characterize the graphs for which the bounds are attained. Moreover, some known lower bounds on the spectral radius and the Laplacian spectral radius of unweighted graphs can be deduced from the bounds.

Spectral radius of uniform hypergraphs and degree sequences

We present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences.

On the Sharp Upper Bound of Spectral Radius of Weighted Trees

The spectrum of weighted graphs are often used to solve the problems in the design of networks and electronic circuits. In this paper, we derive the sharp upper bound of spectral radius of all weighted trees on given order and edge independence number, and obtain all such trees that their spectral radius reach the upper bound.

Unicyclic Graphs of Minimal Spectral Radius

It was conjectured by Li and Feng in 1979 that the unicyclic graph formed by a cycle of order g linking to an endvertex of a path of length k minimizes the spectral radius of all unicyclic graphs of order g ＋ k and girth g. In 1987, Cao proved that this conjecture is true for k ≥ g（g - 2）/8 and false for k = 2 and sufficiently large g. In this note, we show that g 〉12 suffices for the counterexample and give more counterexamples with large girth for any integer k 〉 1.

lk,s-Singular values and spectral radius of partially symmetric rectangular tensors

The real rectangular tensors arise from the strong ellipticity condition problem in solid mechanics and the entanglement problem in quantum physics. In this paper, we first study properties oflk,singular values of real rectangular tensors. Then, a necessary and sufficient condition for the positive definiteness of partially symmetric rectangular tensors is given. Furthermore, we show that the weak Perron-Frobenius theorem for nonnegative partially symmetric rectangular tensor keeps valid under some new conditions and we prove a maximum property for the largest lk,S-singular values of nonnegative partially symmetric rectangular tensor. Finally, we prove that the largest lk,s- singular value of nonnegative weakly irreducible partially symmetric rectangular tensor is still geometrically simple.

Maximizing Spectral Radius of Trees with Given Maximal Degree

In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respectively.