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

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.

给定点连通度的图的补图的无符号拉普拉斯谱半径

假设G是一个具有点集V(G)={v_(1),v_(2),…,v_(n)}和边集E(G)的连通简单图,矩阵Q(G)=D(G)+A(G)被称为图G的无符号拉普拉斯矩阵,其中D(G)和A(G)分别是图G的度对角矩阵和邻接矩阵。称矩阵Q(G)的最大特征值为图G的无符号拉普拉斯谱半径。图G的补图记为G^(c)=(V(G^(c))),E(G^(c)),这里V(G^(c))=V(G)和E(G^(c))={xy|x,y∈V(G),xy∉E(G)}.文章在给定点连通度且直径大于3的图的所有补图中,确定了无符号拉普拉斯谱半径达到最小时的唯一图。

可迹图的一些新充分条件

设图G是一个简单连通图,e(G)、μ(G)和q(G)分别为图G的边数、谱半径和无符号拉普拉斯谱半径。如果一个图含有一条包含所有顶点的路,则这条路为哈密尔顿路,称这个图为可迹图。本文主要研究利用e(G)、μ(G)和q(G)分别给出图G是可迹图的一些新充分条件,所得结果推广了已有的结论。

不含悬挂点的双圈图及三圈图的谱半径

无符号拉普拉斯谱研究的目的是通过分析图像或数据的频域特征来实现特定任务。图的顶点度矩阵与邻接矩阵的和称为无符号拉普拉斯矩阵,连通图的无符号拉普拉斯矩阵是非负不可约矩阵,其最大特征值被称为无符号拉普拉斯谱半径。满足边数与顶点数差为1的图被称为双圈图,边数与顶点数差为2的图被称为三圈图。图谱问题一直是图论中的热点研究问题,文章分别确定了所有不含悬挂点的双圈图及三圈图的图类中具有最大无符号拉普拉斯谱半径的图的结构。

Lower Bounds of Distance Laplacian Spectral Radii of n-Vertex Graphs in Terms of Fractional Matching Number

A fractional matching of a graph G is a function f: E(G)→[0,1] such that for each vertex v, ∑eϵΓG(v)f(e)≤1.. The fractional matching number of G is the maximum value of ∑e∈E(G)f(e) over all fractional matchings f. Tian et al. (Linear Algebra Appl 506:579–587, 2016) determined the extremal graphs with minimum distance Laplacian spectral radius among n-vertex graphs with given matching number. However, a natural problem is left open: among all n-vertex graphs with given fractional matching number, how about the lower bound of their distance Laplacian spectral radii and which graphs minimize the distance Laplacian spectral radii? In this paper, we solve these problems completely.

Upper bounds for signless Laplacian Z-spectral radius of uniform hypergraphs

Let ■ be a k-uniform hypergraph on n vertices with degree sequence △= d1≥…≥ dn =δ. In this paper, in terms of degree di , we give some upper bounds for the Z-spectral radius of the signless Laplacian tensor (Q(■)) of ■. Some examples are given to show the efficiency of these bounds.

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).

两个图Q-谱距离及其应用

把两个图的谱距离推广到两个图的Q-谱距离,给出任意两个图的Q-谱距离的一般性结论,并计算一些特殊图类的Q-谱距离。同时,利用Q-谱距离讨论Q-谱直径,得到一些相应的结论和猜想。

一般图与二部图中完美匹配关于距离无符号拉普拉斯谱半径的存在性

令D(G)=(D_(i,j))为连通图G的距离矩阵,其中D_(i,j)等于顶点v_(i)和v_(j)之间的距离.令η1(G)为图G的距离无符号拉普拉斯谱半径,即距离无符号拉普拉斯矩阵Q(G)=Diag(Tr)+D(G)的最大特征值,其中Diag(Tr)为对角矩阵,Diag(Tr)_(ii)=Σ_(vivj∈E)(G)D_(i,j).在本文中,我们研究图中完美匹配的存在性与距离无符号拉普拉斯谱半径之间的关系,并分别给出关于距离无符号拉普拉斯谱半径的一般图和二部图存在完美匹配的充分条件.

无符号拉普拉斯谱半径与图的哈密尔顿性

在结构图论中,图的哈密尔顿性的谱刻画是最具有影响力的课题之一,其主要思想是判断一个图是不是哈密尔顿图,这是NP-完全问题。因此,诸多学者对哈密尔顿性问题的研究主要集中在寻找适当的充分条件。本文借助补图的无符号拉普拉斯谱半径来刻画具有较大最小度的图的哈密尔顿性。首先,采用反证法构造了原图的闭包,将原图是否具有某性质转化到其闭包中;其次对闭包补图的结构进行了合理的分类讨论;最后分别给出了具有较大最小度的图G是哈密尔顿的,哈密尔顿-连通的以及从任意点出发可迹的关于无符号拉普拉斯谱半径的充分条件。

图的Sum-connectivity指标与其无符号拉普拉斯谱半径

设G=(V,E)为简单连通图.图G的Sum-connectivity指标被定义为χ(G)=Σuv∈E(G)2/√d_(u)+d_(v),其中d_(u)表示顶点u的度.用q(G)表示图G的无符号拉普拉斯谱半径.本文研究了χ(G)与q(G)之间的关系,证明了对于所有顶点数n≥3的简单连通图G,都有q(G)/χ^(2)(G)≤n^(2)/(n-1)^(2)等式成立当且仅当G■S_(n).

Distance signless Laplacian eigenvalues of graphs

Suppose that the vertex set of a graph G is V(G) ={v1,v2,...,vn}.The transmission Tr(vi) (or Di) of vertex vi is defined to be the sum of distances from vi to all other vertices.Let Tr(G) be the n × n diagonal matrix with its (i,i)-entry equal to TrG(vi).The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G,defined as L(G) =Tr(G) + D(G),where D(G) is the distance matrix of G.In this paper,we give a lower bound on the distance signless Laplacian spectral radius of graphs and characterize graphs for which these bounds are best possible.We obtain a lower bound on the second largest distance signless Laplacian eigenvalue of graphs.Moreover,we present lower bounds on the spread of distance signless Laplacian matrix of graphs and trees,and characterize extremal graphs.

Distance signless Laplacian spectrum of a graph

Let G be a simple connected graph with n vertices.The transmission Tv of a vertex v is defined to be the sum of the distances from v to all other vertices in G,that is,T_(v)=Σ_(u)∈Vd_(uv),where duv denotes the distance between u and v.Let T_(1),…,T_(n)be the transmission sequence of G.Let D=(dij)_(n×n)be the distance matrix of G,and T be the transmission diagonal matrix diag(T_(1),…,T_(n)).The matrix Q(G)=T+D is called the distance signless Laplacian of G.In this paper,we provide the distance signless Laplacian spectrum of complete k-partite graph,and give some sharp lower and upper bounds on the distance signless Laplacian spectral radius q(G).

谱半径和特征显著性约束的随机化社会网络方法

为了保护社会网络的安全性,保证扰动后社会网络的可用性,提出谱半径和特征显著性(非随机化性)约束的多点扰动社会网络的方法。在扰动社会网络过程中,将社会网络的谱半径和特征显著性控制在一定的约束范围内,从而在保证扰动后社会网络的可用性同时,提高扰动后社会网络的隐私保护程度。理论上分析了该方法的安全性更好,并给出相应的算法。最后通过实验比较随机化后社会网络的调和平均最短距离、传递系数和特征显著性结构性质的变化情况,表明该方法能有效地保护社会网络的结构性质,提高扰动后的可用性。

具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径(英文)

一个连通图G的距离无符号拉普拉斯谱半径是G的距离无符号拉普拉斯矩阵的谱半径.G的距离无符号拉普拉斯矩阵定义为Q(G)=Tr(G)+D(G),这里Tr(G)是G的顶点传递的对角阵,且D(G)是G的距离矩阵.研究了所有n阶具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径的极小值,并刻画了一类n阶具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径的极大值与极小值.

含割点的连通图的最小距离无符号Laplace谱半径

在含割点的n阶连通图类中,通过运用特征向量研究特征值的方法,确定了具有最小距离无符号Laplace谱半径的唯一的图,并且给出了距离无符号Laplace谱半径关于阶数n的一个下界.

恰有k个悬挂点的n阶双圈和三圈图的拟拉普拉斯谱半径

设k,n为两个确定的正整数.本文得到了当1≤k≤n-7时恰有k个悬挂点的n阶连通三圈图的最大拟拉普拉斯谱半径的唯一极图,也得到了当1≤k≤n-5时恰有k个悬挂点的n阶连通双圈图的最大拟拉普拉斯谱半径的唯一极图.