Related papers: A lower bound for nodal count on discrete and metr…
We study the fluctuation behavior of individual eigenvalues of kernel matrices arising from dense graphon-based random graphs. Under minimal integrability and boundedness assumptions on the graphon, we establish distributional limits for…
An intersection graph of curves in the plane is called a string graph. Matousek almost completely settled a conjecture of the authors by showing that every string graph of m edges admits a vertex separator of size O(\sqrt{m}\log m). In the…
We study the point spectrum of a periodic quantum tree equipped with a Schr\"odinger type differential operator with delta-type vertex conditions, using subsets of the compact graph that generates the tree. We prove analogs of existing…
A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of…
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…
The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda$ can be defined by a finite set of forbidden induced subgraphs if and only…
We investigate statistical properties of the eigenfunctions of the Schrodinger operator on families of star graphs with incommensurate bond lengths. We show that these eigenfunctions are not quantum ergodic in the limit as the number of…
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…
Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$…
Given a discrete Schr\"odinger operator $h$ on a finite connected graph $G$ of $n$ vertices, the nodal count $\phi(h,k)$ denotes the number of edges on which the $k$-th eigenvector changes sign. A {\em signing} $h'$ of $h$ is any real…
In 2018, the concept of a fort in graph theory was introduced as a non-empty subset of vertices satisfying the condition that no vertex outside the set has exactly one neighbor in the set. Since then, forts have played a significant role in…
This work studies geometrical characterizations of the essential spectrum $\sigma_{\text ess}$ of Schr\"odinger operators on graphs. Especially we focus on generalizing characterizations which are given in terms of the concept of right…
The availability of graph data with node attributes that can be either discrete or real-valued is constantly increasing. While existing kernel methods are effective techniques for dealing with graphs having discrete node labels, their…
We prove an analogue of the magnetic nodal theorem on quantum graphs: the number of zeros $\phi$ of the $n$-th eigenfunction of the Schr\"odinger operator on a quantum graph is related to the stability of the $n$-th eigenvalue of the…
We study oscillations in the eigenfunctions for a fractional Schr\"odinger operator on the real line. An argument in the spirit of Courant's nodal domain theorem applies to an associated local problem in the upper half plane and provides a…
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
Let $\eta(G)$ be the number of connected induced subgraphs in a graph $G$, and $\overline{G}$ the complement of $G$. We prove that $\eta(G)+\eta(\overline{G})$ is minimum, among all $n$-vertex graphs, if and only if $G$ has no induced path…
In the standard CONGEST model for distributed network computing, it is known that "global" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is…
We develop further a new geometrical model of a discretized string, proposed in [1] and establish its basic physical properties. The model can be considered as the natural extention of the usual Feynman amplitude of the random walks to…
We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-difference degeneracy) at most $d$ if it admits an elimination…