Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs

Let G be a simple graph with n vertices and m edges. In this paper, we present some new upper bounds for the adjacency and the signless Laplacian spectral radius of graphs in which every pair of adjacent vertices has at least one common adjacent vertex. Our results improve some known upper bounds. The main tool we use here is the Lagrange identity.

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.

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.

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.

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.

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)

The Signless Laplacian Spectral Radius of Some Special Bipartite Graphs

This paper mainly researches on the signless laplacian spectral radius of bipartite graphs Dr(m1,m2;n1,n2). We consider how the signless laplacian spectral radius of Dr(m1,m2;n1,n2)?changes under some special cases. As application, we give two upper bounds on the signless laplacian spectral radius of Dr(m1,m2;n1,n2), and determine the graphs that obtain the upper bounds.

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.

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.

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.

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.

THE SPECTRAL PROPERTIES OF THE ITERATION MATRIX OF REGULAR SPLITTINGS FOR AN M-MATRIX

Let A=M-N be a regular splitting of an M-matrix. We study the spectral properties of the ineration matrix M-1N. Under a mild assumption on M-1 N. some necessary and sufficent conditions such that p(M-1N)=1 are obtained and the algebraic multiplicity and the index associated with eigenvalue 1 in M-1N are considered.

The Spectral Radii of Some Adhesive Graphs

The spectral radius of a graph is the maximum eigenvalues of its adjacency matrix. In this paper, using the property of quotient graph, the sharp upper bounds for the spectral radii of some adhesive graphs are determined.

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.

The Spectral Radii of Intersecting Uniform Hypergraphs

The celebrated Erdos-Ko-Rado theorem states that given n≥2k,every intersecting k-uni-n-1 form hypergraph G on n vertices has at most(n-1 k-1)edges.This paper states spectral versions of the Erd6s-_Ko--Rado theorem:let G be an intersecting k-uniform hypergraph on n vertices with n≥2k.Then,the sharp upper bounds for the spectral radius of Aα(G)and 2*(G)are presented,where Aα(G)=αD(G)+(1-α).A(G)is a convex linear combination of the degree diagonal tensor D(G)and the adjacency tensor A(G)for 0≤α<1,and Q^(*)(G)is the incidence Q-tensor,respectively.Furthermore,when n>2k,the extremal hypergraphs which attain the sharp upper bounds are characterized.The proof mainly relies on the Perron-Frobenius theorem for nonnegative tensor and the property of the maximizing connected hypergraphs.

城市轨道交通轨面短波不平顺谱实测研究

针对城市轨道交通诱发的振动噪声问题,对轨面短波不平顺进行研究.首先,对上海市轨道交通线路轨面短波不平顺实测数据进行零均值化、剔除异常值、消除趋势项等预处理.其次,利用改进的协方差法计算得到轨面短波不平顺功率谱,分析轨道类型、曲线半径及钢轨接头对轨面短波不平顺功率谱分布规律的影响.然后,基于非线性最小二乘法对轨面短波不平顺谱进行拟合.最后,提出我国城市轨道交通轨面短波不平顺统计谱表达式.研究结果表明:直线段接头区轨面短波不平顺功率谱密度曲线在整个分析波长范围内具有较多特征峰值;直线段接头区上、下行短波不平顺功率谱密度值随波长的分布特征和数值相差不大,说明上、下行的轨面不平顺状态基本相同;钢轨的磨耗程度与曲线半径呈负相关,内、外轨面不平顺功率谱密度的差异随曲线半径的增大而减小,曲线半径是影响轨面不平顺状态的主要因素之一;线路类型对轨面短波不平顺功率谱的影响不大,不同曲线半径、焊接接头影响明显,在对轨道进行维护和养护时需关注小曲线半径区段以及焊接接头区段的不平顺状态.

关于赋权非正则图的A_(α)特征值和特征向量

设G_(ω)=(G,ω)是一个赋权图,其邻接矩阵和赋权度对角矩阵分别A(G_(ω))和D(G_(ω))。对于α∈[0,1],G_(ω)的A_(α)-矩阵为A_(α)(G_(ω))=αD(G_(ω))+(1-α)A(G_(ω))。对于连通赋权非正则图G_(ω),给出了其关于A_(α)-特征值的一些界,并得到了A_(α)-谱半径对应的特征向量中最大分量与最小分量比值的下界。