In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.

in this paper we provide‎ ‎existence results for positive solution to‎ ‎dirichlet p(t)-laplacian boundary value problems‎. ‎the sublinear and‎ ‎superlinear cases are considerd‎.

We obtain a large number of degree and distance-based topological indices, graph Laplacian spectra the corresponding polynomials, entropies matching polynomials n-dimensional hypercubes through use Hadamard symmetry recursive dynamic computational techniques. Moreover, computations are used to provide independent numerical values for indices 11- 12-cubes. invoke symmetry-based transforms nD-hyp...

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

This paper studies the problem of fault detection and isolation (FDI) for multi-agent systems (MAS) via complex Laplacian subject to actuator faults. A planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacian is achieved. The communication network is a directed, and yet connected graph with a fixed topology. The loss of symmetry in the...

Serial assessments of neurocognitive functioning in athletes with concussion are commonly used for return to play decisions. This study provides reliable change indices (RCIs) for computerized tests from 40 NCAA Division I collegiate athletes that suffered a sports-related concussion. The normative data that resulted from the RCIs and subsequent analyses of differences between improved and not ...

the k-th semi total point graph of a graph g, , ‎is a graph‎ obtained from g by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎in this paper‎, a formula for laplacian polynomial of in terms of‎ characteristic and laplacian polynomials of g is computed‎, ‎where is a connected regular graph‎.the kirchhoff index of is also computed‎.

The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected c...

7 We present a statistical analysis of the initiation and termination of boreal winter and boreal summer 8 intraseasonal oscillations (ISOs). This study uses purely convection (infrared brightness temperature) 9 data over a 23-year time interval from 1984–2006. The indices are constructed via the nonlinear Laplacian 10 spectral analysis (NLSA) method and display high intermittency and non-Gauss...