S. Akbari, E. Ghorbani, M. R. Oboudi
We conjecture that the sum of the square roots of the Laplacian eigenvalues of a graph does not exceed the sum of the square roots of its signless Laplacian eigenvalues.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, we first give the necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues, and then characterize the trees and unicyclic graphs with exactly two main signless Laplacian eigenvalues, respectively.
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq 456$.
In this paper, we determine the maximal Laplacian and signless Laplacian spectral radii for graphs with fixed number of vertices and domination number, and characterize the extremal graphs respectively.
We generalize the notions of Laplacian and signless Laplacian Estrada index to uniform hypergraphs. For an $r$-uniform hypergraph $H,$ we derive an order $r+1$ trace formula of the (signless) Laplacian tensor of $H.$ Among others by using this trace formula, we obtain lower bounds for the signless Laplacian Estrada index and upper bounds for the Laplacian Estrada index. Moreover, we establish a bound involving both the Laplacian Estrada index and Laplacian energy of a uniform hypergraph.
On the Eccentricity Laplacian and Eccentricity Signless Laplacian Matrices of a Graph
本文引入了图的偏心度矩阵的拉普拉斯和无符号拉普拉斯矩阵，探讨了不同图类中偏心度拉普拉斯、偏心度无符号拉普拉斯和偏心度谱之间的等价性，并通过偏心度谱的对称性和这些拉普拉斯矩阵的相似性对E-双图进行谱刻画。
Let $G$ be a connected $m$-uniform hypergraph. In this paper we mainly consider the eigenvectors of the Laplacian or signless Laplacian tensor of $G$ associated with zero eigenvalue, called the first Laplacian or signless Laplacian eigenvectors of $G$. By means of the incidence matrix of $G$, the number of first Laplacian or signless Laplaican (H- or N-)eigenvectors can be get explicitly by solving the Smith normal form of the incidence matrix over $\mathbb{Z}_m$ or $\mathbb{Z}_2$. Consequently, we prove that the number of first Laplacian (H-)eigenvectors is equal to the number of first signle…
Let $G$ be a simple $r$-regular graph with $n$ vertices and $m$ vertices. We give the signless Laplacian characteristic polynomials of $xyz$-transformations $G^{xyz}$ of $G$ in terms of $n$, $m$, $r$ and the signless Laplacian spectrum of $G$.
In this paper, we obtain the bounds of the extreme eigenvalues of a normalized and signless Laplacian matrices using by their traces. In addition, we determine the bounds for k-th eigenvalues of normalized and signless Laplacian matrices.
A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected bicyclic graphs with exactly two main eigenvalues are determined.
M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the sharp upper bounds of the spectral radius of a nonnegative matrix, then apply these theorems to signless Laplacian matrices and the distance signless Laplacian matrices to obtain some sharp bounds on the spectral radius, respectively. We also proposed a known result about the sharp bound of the signless Laplacian spectral radius has a defect.
The signless Laplacian Q and signless edge-Laplacian S of a given graph may or may not be invertible. The Moore-Penrose inverses of Q and S are studied. In particular, using the incidence matrix, we find combinatorial formulas of the Moore- Penrose inverses of Q and S for trees. Also we present combinatorial formulas of the inverses of Q and S for odd unicyclic graphs.
Let $G$ be a graph with $n$ vertices, and let $L(G)$ and $Q(G)$ be the Laplacian matrix and signless Laplacian matrix of $G$, respectively. The polynomial $π(L(G);x)={\rm per}(xI-L(G))$ (resp. $π(Q(G);x)={\rm per}(xI-Q(G))$) is called {\em Laplacian permanental polynomial} (resp. {\em signless Laplacian permanental polynomial}) of $G$. In this paper, we show that two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.
On non-bipartite graphs with integral signless Laplacian eigenvalues at most 6
该研究完成了符号拉普拉斯特征值为不超过6的整数的连通非二部图的完整分类工作，属于组合数学领域的图论研究。
The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and adding a new edge between two new vertices which lie on adjacent edges of $G$. In this paper, we consider to study the existence of the signless Laplacian perfect state transfer and signless Laplacian pretty good state transfer in $\mathcal{Q}$-graphs of graphs. We show that, if all the signless Laplacian eigenvalues of a regular graph $G$ are integers, then the $\mathcal{Q}$-graph of $G$ has no signless Laplacian perfect state transfer. We also gi…
In this paper, we present a spectral sufficient condition for a graph to be Hamilton-connected in terms of signless Laplacian spectral radius with large minimum degree.
{Signless Laplacian determinations of some graphs with independent edges}% {Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively. The graph $G$ is said to be determined by its signless Laplacian spectrum ({\rm DQS}, for short), if any graph having the same signless Laplacian spectrum as $G$ is isomorphic to $G$. We show that $G\sqcup rK_2$ is determined by its signless Laplacian spectra under certain conditions, where $r$ and $K_2$ denote a natura…
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we show that there are exactly two tricyclic graphs with the maximal signless Laplacian Estrada index.
Distribution of signless Laplacian eigenvalues and graph invariants
本文研究了简单图的无符号拉普拉斯特征值分布，揭示了特定区间内的特征值数量与匹配数、直径等图不变量之间的关系。
In this paper, we use a new and correct method to determine the $n$-vertex $k$-trees with the first three largest signless Laplacian indices.
In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition, these results disprove the two conjectures on the signless Laplacian spectral radius in [P. Hansen and C. Lucas, Bounds and conjectures for the signless Laplacian index of graphs, Linear Algebra Appl., 432(2010) 3319-3336].
Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived. Some of the above mentioned bounds are sharp and the graphs attaining the corresponding bound are characterized. Several illustrative examples are included.
The smallest normalized signless $\infty$-Laplacian eigenvalue for non-bipartite connected graphs
本文研究了非二部连通图的最小规范化无符号∞-拉普拉斯特征值，证明其等于加权无符号关联矩阵广义逆的最小∞-范数的倒数，并举例说明。
In this paper, we present some spectral sufficient conditions for a graph to be Hamilton-connected in terms of the spectral radius or signless Laplacian spectral radius of the graph. Our results improve some previous work.
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 unicyclic, and bicyclic, $C_{4}$-free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the (combinatorial) Laplacian.
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be Hamilton-connected and traceable from every vertex, respectively. Last, we obtain a sufficient condition for a graph to be Hamiltonian in terms of the distance signless Laplacian spectral radius of $G^{C}$.
We consider the signless $p$-Laplacian of a graph, a generalisation of the usual signless Laplacian (the case $p=2$). We show a Perron-Frobenius property and basic inequalites for the largest eigenvalue and provide upper and lower bounds for the smallest eigenvalue in terms of a parameter related to the bipartiteness. The latter result generalises bounds by Desai and Rao and, interestingly, in the limit $p\to 1$ upper and lower bounds coincide.
In this paper we determine the graph whose least eigenvalue of signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and an upper bound for the least eigenvalue of signless Laplacian of a graph in terms of the number of pendent vertices.
Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$. The signless Laplacian matrix of a graph $G$ is $Q(G)=D(G)+A(G)$, where $A(G)$ and $D(G)$ denote, respectively, the adjacency and the diagonal matrix of the vertex degrees of $G$. Let $q_1\geq q_2\geq \dots\geq q_n\geq 0$ be the signless Laplacian eigenvalues of $G$. The largest signless Laplacian eigenvalue $q_1$ is called the signless Laplacian spectral radius or $Q$-i…
The $α$-Hermitian adjacency matrix $H_α$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number $α$. This enables us to define an incidence matrix of mixed graphs. Consequently, we define a generalization of line graphs as well as a generalization of the signless Laplacian adjacency matrix of graphs. We then study the spectral properties of the signless Laplacian adjacency matrix of a mixed graph. Lastly, we characterize when the signless Laplacian adjacency matrix o…
Let $G$ be an unicyclic graph of order $n$ and let $Q_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i φ_i x^{n-i}{matrix}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations of $G$ which decrease all signless Laplacian coefficients in the set $\mathcal{G}(n,m)$. $\mathcal{G}(n,m)$ denotes all n-vertex unicyclic graphs with matching number $m$. We characterize the graphs which minimize all the signless Laplacian coefficients in the set $\mathcal{G}(n,m)$ with odd (resp. even) girth. Moreover, we find the extremal graphs which have mini…
We give sharp upper bounds for the ordinary spectral radius and signless Laplacian spectral radius of a uniform hypergraph in terms of the average $2$-degrees or degrees of vertices, respectively, and we also give a lower bound for the ordinary spectral radius. We also compare these bounds with known ones.
In this paper, we investigate (signless) Laplacian spectral characterization of graphs with star components. Also, we prove that the join graph ${\small K_{n-α}-e\vee αK_{1}}$ is $DQS$ for $n-α>3$ and $α\neq3$, and for $α=3$, we show that its only $Q$-cospectral mate is $\bar{K_{1,3}\cup K_{2}\cup (n-6)K_{1}}$.
Let $Z(G)$ be the centre of a finite non-abelian group $G.$ The non-commuting graph of $G$ is a simple undirected graph with vertex set $G\setminus Z(G),$ and two vertices $u$ and $v$ are adjacent if and only if $uv\ne vu.$ In this paper, we investigate the distance, distance (signless) Laplacian spectra of non-commuting graphs of some classes of finite non-abelian groups, and obtain some conditions on a group so that the non-commuting graph is distance, distance (signless) Laplacian integral.
Let $\mathcal{H}$ be a connected $k$-uniform hypergraph on $n$ vertices and $m$ hyperedges. In [A.~Banerjee, On the spectrum of hypergraph, Linear Algebra and its Application, 614(2021), 82--110], Anirban Banerjee introduced a new adjacency matrix for hypergraphs. In this article we consider the corresponding signless Laplacian matrix $Q(\mathcal{H})$ and discuss about its spectrum.
Let $G$ be a simple graph and $Q(G)$ be the signless Laplacian matrix of $G$. Let $S_α(G)$ be the sum of the $α$-th powers of the nonzero eigenvalues of $Q(G)$. We disprove two conjectures by You and Yang on the extremal values of $S_α(G)$ among bipartite graphs and among graphs with bounded connectivity.
Signless Laplacian Estrada index of a graph $G$, defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$, where $q_1, q_2, \cdots, q_n$ are the eigenvalues of the matrix $\mathbf{Q}(G)=\mathbf{D}(G)+\mathbf{A}(G)$. We determine the unique graphs with maximum signless Laplacian Estrada indices among the set of graphs with given number of cut edges, pendent vertices, (vertex) connectivity and edge connectivity.
For a graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q^{}_i}$,where $q_1, q_2, \dots, q_n$are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$ and then determine the unique unicyclic graph with maximum $SLEE$ among the unicyclic graphs on $n$ vertices with given diameter.
A note on the distance and distance signless Laplacian spectral radius of complements of trees
该研究通过分析广义树移位操作对树补图三类谱半径的增大作用，修正了既有相关定理证明中的歧义。
Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $γ\le \frac{n+1}{3}$. We investigate the least eigenvalue of the signless Laplacian of $G$, and present a lower bound for such eigenvalue in terms of the domination number $γ$.
Suppose that the vertex set of a connected graph $G$ is $V(G)=\{v_1,\cdots,v_n\}$. Then we denote by $Tr_{G}(v_i)$ the sum of distances between $v_i$ and all other vertices of $G$. Let $Tr(G)$ be the $n\times n$ diagonal matrix with its $(i,i)$-entry equal to $Tr_{G}(v_{i})$ and $D(G)$ be the distance matrix of $G$. Then $Q_{D}(G)=Tr(G)+D(G)$ is the distance signless Laplacian matrix of $G$. The largest eigenvalues of $Q_D(G)$ is called distance signless Laplacian spectral radius of $G$. In this paper we give some graft transformations on distance signless Laplacian spectral radius of the grap…
An interlacing property of the signless Laplacian of threshold graphs
该研究证明了阈值图的无符号拉普拉斯矩阵特征值与顶点度数存在交错性质，并以此为基础验证了无符号Brouwer猜想对阈值图成立，给出了前k大特征值和的上界表达式。
For a simple graph $G$ and a real number $α$ $\left(α\neq 0,1\right) $ the graph invariant $s_α\left(G\right) $ is equal to the sum of powers of signless Laplacian eigenvalues of $G$. In this note, we present some new bounds on $s_α\left(G\right) $. As a result of these bounds, we also give some results on incidence energy.
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. In this paper, we present a sharp upper bound for the signless spectral radius of $G$ without any tree and characterize all extremal graphs which attain the upper bound, which may be regarded as a spectral extremal version for the famous Erdős-Sós conjecture.
A connected graph $G$ is a cactus if any two of its cycles have at most one common vertex. Let $\ell_n^m$ be the set of cacti on $n$ vertices with matching number $m.$ S.C. Li and M.J. Zhang determined the unique graph with the maximum signless Laplacian spectral radius among all cacti in $\ell_n^m$ with $n=2m$. In this paper, we characterize the case $n\geq 2m+1$. This confirms the conjecture of Li and Zhang(S.C. Li, M.J. Zhang, On the signless Laplacian index of cacti with a given number of pendant vetices, Linear Algebra Appl. 436, 2012, 4400--4411). Further, we characterize the unique grap…
Signless Laplacian index conditions for trebly chorded cycles in graphs with given order
研究证明，当图的无向拉普拉斯指数大于等于某个依赖于n的值时，图中包含三重弦环，除非是两种指定图之一。
Combinatorial formula for the Moore-Penrose inverse of the complex signless Laplacian of an oriented graph
研究具有非零复边权重的弱连通有向图，通过找到无符号关联矩阵秩的充要条件，得出复无符号关联矩阵和复无符号拉普拉斯矩阵的摩尔 - 彭罗斯逆的组合公式，解决了相关开放问题。
Recently Ayyaswamy [1] have introduced a novel concept of the signless Laplacian Estrada index (after here $SLEE$) associated with a graph $G$. After works, we have identified the unique graph with maximum $SLEE$ with a given parameter such as: number of cut vertices, (vertex) connectivity and edge connectivity. In this paper we continue out characterization for two further parameters; diameter and number of cut vertices.
The distance matrix $\mathcal{D}$ of a connected graph $G$ is the matrix indexed by the vertices of $G$ which entry $\mathcal{D}_{i,j}$ equals the distance between the vertices $v_i$ and $v_j$. The distance signless Laplacian matrix $\mathcal{Q}(G)$ of graph $G$ is defined as $\mathcal{Q}(G)=Diag(Tr)+\mathcal{D}(G)$, where $Diag(Tr)$ is the diagonal matrix of the vertex transmissions in $G$. The largest eigenvalue of $\mathcal{Q}(G)$ is called the distance signless Laplacian spectral radius of $G$, written as $η_1(G)$. And a perfect matching in a graph is a set of disadjacent edges covering ev…
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to determine the Hamiltonicity of graphs.
Signless Laplacian spectral radius of simplicial complexes without holes
研究无洞单纯复形的无符号拉普拉斯谱半径的极值问题，扩展了无环图的经典极值结果到高维单纯复形，同时建立具有指定贝蒂数的单纯复形的无符号拉普拉斯谱半径上界，并推导出超图和单纯复形的图论数上界。
Signless Laplacian index conditions for doubly chorded cycles in graphs with given order
本文给出阶数至少为5的图中存在双弦圈（弦共顶点）的无穷拉普拉斯指数充分条件，并刻画了两个例外图。
Let $G$ be a graph of order $n$ and $Q_G(x)= det(xI-Q(G))= \sum_{i=1}^n (-1)^i φ_i x^{n-i}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations of $G$ which decrease all signless Laplacian coefficients in the set $\mathcal{B}(n)$ of all $n$-vertex bicyclic graphs. $\mathcal{B}^1(n)$ denotes all n-vertex bicyclic graphs with at least one odd cycle. We show that $B_n^1$ (obtained from $C_4$ by adding one edge between two non-adjacent vertices and adding $n-4$ pendent vertices at the vertex of degree 3) minimizes all the signless Laplacia…
Let $S_{1}(m, d, k)$ be the $k$-uniform supertree obtained from a loose path $P:v_{1}, e_{1}, v_{2}, \ldots,v_{d}, e_{d}, v_{d+1}$ with length $d$ by attaching $m-d$ edges at vertex $v_{\lfloor\frac{d}{2}\rfloor+1}.$ Let $\mathbb{S}(m,d,k)$ be the set of $k$-uniform supertrees with $m$ edges and diameter $d$ and $q(G)$ be the signless Laplacian spectral radius of a $k$-uniform hypergraph $G$. In this paper, we mainly determine $S_{1}(m,d,k)$ with the largest signless Laplacian spectral radius among all supertrees in $\mathbb{S}(m,d,k)$ for $3\leq d\leq m-1$. Furthermore, we determine the uniqu…
For a graph $G$ and a non-zero real number $α$, the graph invariant $S_α(G)$ is the sum of the $α^{th}$ power of the non-zero signless Laplacian eigenvalues of $G$. In this paper, we obtain the sharp bounds of $S_α(G)$ for a connected bipartite graph $G$ on $n$ vertices and a connected graph $G$ on $n$ vertices having a connectivity less than or equal to $k$, respectively, and propose some open problems for future research.
Let $G$ be a finite non abelian group. The centralizer graph of $G$ is a simple undirected graph $Γ_{cent}(G)$, whose vertices are the proper centralizers of $G$ and two vertices are adjacent if and only if their cardinalities are identical {\rm\cite{omer}}. The complement of the centralizer graph is called the co-centralizer graph. In this paper, we investigate the adjacency and (signless) Laplacian spectra of centralizer and co-centralizer graphs of some classes of finite non-abelian groups and obtain some conditions on a group so that the centralizer and co-centralizer graphs are adjacency,…
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a similar combinatorial interpretation for principal minors of signless Laplacian $Q$. We also prove that the number of odd cycles in $G$ is less than or equal to $\frac{\det(Q)}{4}$, where the equality holds if and only if $G$ is a bipartite graph or an odd-unicyclic graph.
Suppose that $G$ is a connected simple graph with the vertex set $V(G)=\{v_1, v_2,\cdots,v_n\}$. Then the adjacency matrix of $G$ is $A(G)=(a_{ij})_{n\times n}$, where $a_{ij}=1$ if $v_i$ is adjacent to $v_j$, and otherwise $a_{ij}=0$. The degree matrix $D(G)=diag(d_{G}(v_1), d_{G}(v_2), \dots, d_{G}(v_n)),$ where $d_{G}(v_i)$ denotes the degree of $v_i$ in the graph $G$ ($1\leq i\leq n$). The matrix $Q(G)=D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The least eigenvalue of $Q(G)$ is also called the least signless Laplacian eigenvalue of $G$. In this paper we give two graft trans…
For a simple graph $G$ with $n$ vertices, $m$ edges and signless Laplacian eigenvalues $q_{1} \geq q_{2} \geq \cdots \geq q_{n} \geq 0$, its the signless Laplacian energy $QE(G)$ is defined as $QE(G) = \sum_{i=1}^{n}|q_{i} - \bar{d} |$, where $\bar{d} = \frac{2m}{n}$ is the average vertex degree of $G$. In this paper, we obtain two lower bounds ( see Theorem 3.1 and Theorem 3.2 ) and one upper bound for $QE(G)$ ( see Theorem 3.3 ), which improve some known bounds of $QE(G)$, and moreover, we determine the corresponding extremal graphs that achieve our bounds. By subproduct, we also get some bo…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。