论文标题
图形的无标志性laplacian光谱半径没有相交的三角形
The signless Laplacian spectral radius of graphs with no intersecting triangles
论文作者
论文摘要
Let $F_k$ denote the $k$-fan consisting of $k$ triangles which intersect in exactly one common vertex, and $S_{n,k}$ the complete split graph of order $n$ consisting of a clique on $k$ vertices and an independent set on the remaining vertices in which each vertex of the clique is adjacent to each vertex of the independent set.在本文中，可以证明$ s_ {n，k} $是在所有包含no $ f_k $的订单$ n $的最大laplacian频谱半径中获得最大无标识的laplacian光谱半径，但前提是$ k \ geq 2 $和$ n \ geq 2 $和$ n \ geq 3k^2-k-k-2 $。
Let $F_k$ denote the $k$-fan consisting of $k$ triangles which intersect in exactly one common vertex, and $S_{n,k}$ the complete split graph of order $n$ consisting of a clique on $k$ vertices and an independent set on the remaining vertices in which each vertex of the clique is adjacent to each vertex of the independent set. In this paper, it is shown that $S_{n,k}$ is the unique graph attaining the maximum signless Laplacian spectral radius among all graphs of order $n$ containing no $F_k$, provided that $k\geq 2$ and $n\geq 3k^2-k-2$.
