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)

Bipartite Graphs with the First and Second Largest Laplacian Spectral Radius

Let kn 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 kn 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.

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.

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.

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.

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.

Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges(vertices)

Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching m-d edges at vertex u_[d/2]+1.In this paper,we mainly determine S1(m,d,k)with the largest signless Laplacian spectral radius in S(m,d,k)for 3≤d≤m-1.We also determine the supertree with the second largest signless Laplacian spectral radius in S(m,3,k).Furthermore,we determine the unique/c-uniform supertree with the largest signless Laplacian spectral radius among all fc-uniform supertrees with n vertices and pendent edges(vertices).

The Linear Unicyclic Hypergraph with the Second or Third Largest Spectral Radius

The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor of the hypergraph.It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph,and the unique linear unicyclic hypergraph with the largest spectral radius is a power hypergraph.In this paper we determine the unique linear unicyclic hypergraph with the second or third largest spectral radius,where the former hypergraph is a power hypergraph and the latter hypergraph is a non-power hypergraph.

Ordering Trees with Fixed Order and Matching Number by Laplacian Spectral Radius

Let T（n,i） be the set of all trees with order n and matching number i.We determine the third to sixth trees in T（2i ＋ 1,i） and the third to fifth trees in T（n,i） for n ≥ 2i ＋ 2 with the largest Laplacian spectral radius.

On the Spectral Properties of Graphs with Rank 4

Let G be a graph and A(G) the adjacency matrix of G. The spectrum of G is the eigenvalues together with their multiplicities of A(G). Chang et al. (2011) characterized the structures of all graphs with rank 4. Monsalve and Rada (2021) gave the bound of spectral radius of all graphs with rank 4. Based on these results as above, we further investigate the spectral properties of graphs with rank 4. And we give the expressions of the spectral radius and energy of all graphs with rank 4. In particular, we show that some graphs with rank 4 are determined by their spectra.

Spectral Radius of Hamiltonian Planar Graphs and Outerplanar Graphs

The spectral radius is an important parameter of a graph related to networks. A method for estimating the spectral radius of each spanning subgraph is used to prove that the spectral radius of a Hamiltonian planar graph of order n≥4 is less than or equal to 2+3n-11 and the spectral radius of the outerplanar graph of order n≥6 is less than or equal to 22+n-5, which are improvements over previous results. A direction for further study is then suggested.

A generalization of Banach's lemma and its applications to perturbations of bounded linear operators

Let X be a Banach space and let P:X→X be a bounded linear operator.Using an algebraic inequality on the spectrum of P,we give a new sufficient condition that guarantees the existence of(I-P)^(-1) as a bounded linear operator on X,and a bound on its spectral radius is also obtained.This generalizes the classic Banach lemma.We apply the result to the perturbation analysis of general bounded linear operators on X with commutative perturbations.

非正则赋权有向图A_(α)谱半径的上界

Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.