Inspired by the linear Schrödinger operator, we consider a generalized p-Laplacian operator on discrete graphs and present new results that characterize several spectral properties of this with particular attention to nodal domain count its eigenfunctions. Just like one-dimensional continuous p-Laplacian, prove variational spectrum forests is entire spectrum. Moreover, show how transfer Weyl's ...

Abstract. A fractafold, a space that is locally modeled on a specified fractal, is the fractal equivalent of a manifold. For compact fractafolds based on the Sierpiński gasket, it was shown by the first author how to compute the discrete spectrum of the Laplacian in terms of the spectrum of a finite graph Laplacian. A similar problem was solved by the second author for the case of infinite blow...

The set of all eigenvalues of a characteristic matrix of a graph, also referred to as the spectrum, is a well-known topology retrieval method. In this paper, we study the spectrum of the Laplacian matrix of an observable part of the Internet graph at the IPlevel, extracted from traceroute measurements performed via RIPE NCC and PlanetLab. In order to investigate the factors influencing the Lapl...

A connected graph is called Q-controllable if its signless Laplacian eigenvalues are mutually distinct and main. Two graphs G and H are said to be Q-cospectral if they share the same signless Laplacian spectrum. In this paper, infinite families of Q-controllable graphs are constructed, by using the operator of rooted product introduced by Godsil and McKay. In the process, infinitely many non-is...

This paper presents some bounds on the number of Laplacian eigenvalues contained in various subintervals of [0, n] by using the matching number and edge covering number for G, and asserts that for a connected graph the Laplacian eigenvalue 1 appears with certain multiplicity. Furthermore, as an application of our result (Theorem 13), Grone and Merris’ conjecture [The Laplacian spectrum of graph...