A graph is determined by its signless Laplacian spectrum if no other nonisomorphic graph has the same signless Laplacian spectrum (simply G is DQS). Let T (a, b, c) denote the T-shape tree obtained by identifying the end vertices of three paths Pa+2, Pb+2 and Pc+2. We prove that its all line graphs L(T(a, b, c)) except L(T(t, t, 2t+1)) (t ⩾ 1) are DQS, and determine the graphs which have the same signless Laplacian spectrum as L(T(t, t, 2t + 1)). Let µ1(G) be the maximum signless Laplacian eigenvalue of the graph G. We give the limit of µ1(L(T(a, b, c))), too.
22 September 2022 in Indian Journal of Pure and Applied Mathematics
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 transformations and then use them to characterize the unique connected graph whose least signless Laplacian eigenvalue is minimum among the complements of all bicyclic graphs.
30 July 2012 in Acta Mathematica Sinica, English Series