Related papers: The Colin de Verdi\`ere Graph Parameter for Thresh…

Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems…

A traditional Nordhaus-Gaddum problem for a graph parameter $\beta$ is to find a (tight) upper or lower bound on the sum or product of $\beta(G)$ and $\beta(\bar{G})$ (where $\bar{G}$ denotes the complement of $G$). An $r$-decomposition…

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…

We present a pair of conjectural formulas that compute the leading term of the spectral asymptotics of a Schr\"odinger operator on $L^2(\bR^n)$ with quasi-homogeneous polynomial magnetic and electric fields. The construction is based on the…

The energy of a graph is defined as the sum the absolute values of the eigenvalues of its adjacency matrix. A threshold graph G on n vertices is coded by a binary sequence of length n. In this paper we answer a question posed by Jacobs et…

In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smallest eigenvalue by considering a vertex that is adjacent to some (but not all) vertices of the maximal clique. As a consequence, we show that…

Threshold graphs are generated from one node by repeatedly adding a node that links to all existing nodes or adding a node without links. In the weighted threshold graph, we add a new node in step $i$, which is linked to all existing nodes…

We consider the eigenvalue problem for the Schr\"odinger operator on bounded, convex domains with mixed boundary conditions, where a Dirichlet boundary condition is imposed on a part of the boundary and a Neumann boundary condition on its…

For minimally $k$-connected graphs on $n$ vertices, Mader proved a tight lower bound for the number $|V_k|$ of vertices of degree $k$ in dependence on $n$ and $k$. Oxley observed 1981 that in many cases a considerably better bound can be…

We show that if $G=(V,E)$ is a 4-connected flat graph, then any real symmetric $V\times V$ matrix $M$ with exactly one negative eigenvalue and satisfying, for any two distinct vertices $i$ and $j$, $M_{ij}<0$ if $i$ and $j$ are adjacent,…

We count invertible Schr\"odinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fieldsfor trees, cycles and complete graphs.This is achieved for trees through the definition and use of local invariants…

In this paper we are interested in generalizing Keller-type eigenvalue estimates for the non-selfadjoint Schr\"{o}dinger operator to the Dirac operator, imposing some suitable rigidity conditions on the matricial structure of the potential,…

A graph is said to be I-eigenvalue free if it has no eigenvalues in the interval I with respect to the adjacency matrix A. In this paper we present two algorithms for generating I-eigenvalue free threshold graphs.

Motivated by applications of large-scale graph clustering, we study random-walk-based LOCAL algorithms whose running times depend only on the size of the output cluster, rather than the entire graph. All previously known such algorithms…

We prove a criterion for absence of eigenvalues for one-dimensional Schr\"odinger operators. This criterion can be regarded as an $L^1$-version of Gordon's theorem and it has a broader range of application. Absence of eigenvalues is then…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss (2009) who relied on the…

A lower bound on the solution to the traveling salesman problem is provided, which is expressed in terms of eigenvalues related to the distance matrix for the problem. This bound has many interesting properties such as transforming…

Treewidth is an important and well-known graph parameter that measures the complexity of a graph. The Kneser graph Kneser(n,k) is the graph with vertex set $\binom{[n]}{k}$, such that two vertices are adjacent if they are disjoint. We…