Graph Laplacians with Higher Accuracy

Abstract

Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we show that the number of graphs having cospectral mates with these matrices is significantly less than the ones with other known matrices. We also investigate their spectral properties and explicitly compute their eigenvalues and eigenvectors for some graphs. Along the line, we also prove the existence of a weighted signed graph with given Laplacian eigenvalues.