Related papers: A Note on the Laplacian Eigenvectors of Threshold …
We study the eigenvalues of the unique connected anti-regular graph $A_n$. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an…
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here study a generalization of this eigenvalue, denoted $\lambda(G,…
Let $\mathcal{G}(n,k)$ be the set of connected graphs of order $n$ with one of the Laplacian eigenvalue having multiplicity $k$. It is well known that $\mathcal{G}(n,n-1)=\{K_n\}$. The graphs of $\mathcal{G}(n,n-2)$ are determined by Das,…
We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…
We consider the Laplacian in a strip $\mathbb{R}\times (0,d)$ with the boundary condition which is Dirichlet except at the segment of a length $2a$ of one of the boundaries where it is switched to Neumann. This operator is known to have a…
We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…
For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…
We generalize three classical characterizations of line graphs to line graphs of signed and gain graphs: the Krausz's characterization, the van Rooij and Wilf's characterization and the Beineke's characterization. In particular, we present…
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…
For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a…