Conjugate Laplacian eigenvalues of co-neighbour graphs

Source abstract

Let G be a simple graph of order n. A vertex subset is called independent if its elements are pairwise non-adjacent. Two vertices in G are co-neighbour vertices if they share the same neighbours. Clearly, if S is a set of pairwise co-neighbour vertices of a graph G, then S is an independent set of G. Let c=a+b√m and c=a−b√m, where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. In [M. Lepovic, On conjugate adjacency matrices of a graph, Discrete Mathematics, 307, 730-738, 2007], the author defined the matrix Ac(G)=[cij]n to be the conjugate adjacency matrix of G, if cij=c for any two adjacent vertices i and j, cij=c for any two nonadjacent vertices i and j,and cij= 0 if i=j. In [S. Paul, Conjugate Laplacian matrices of a graph, Discrete Mathematics, Algorithms and Applications, 10, 1850082, 2018], the author defined the conjugate Laplacian matrix of graphs and described various properties of its eigenvalues and eigenspaces. In this article, we determine certain properties of the conjugate Laplacian eigenvalues and the eigenvectors of a graph with co-neighbour vertices.