JOURNAL OF SCIENCE AND ARTS, sa.1, ss.175-182, 2018 (ESCI)
Let G be a simple connected graph. We redefine adjacency for any two vertices as defined if there is connected two edges between any two vertices, i and j. This vertices are called two adjacency and denoted by i similar to(2) j. In this study, we defined 2-adjacency Laplacian matrix and denoted by L-similar to 2 (G) from by above definition and we find a lower bound for 2-spectral radius which is denoted by mu(similar to 2)(G) and present an open problem L-similar to 2(G).