Related papers: Sturm-Hurwitz Theorem for quantum graphs
We study the eigenvalues of the Dirichlet-to-Neumann operator on a finite subgraph of the integer lattice Zn. We estimate the first n+1 eigenvalues using the number of vertices of the subgraph. As a corollary, we prove that the first…
In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some…
We prove an analogue for trees of Courant's theorem on the interlacing property of zeros of eigenfunctions of a Schr\"{o}dinger operator. Let $\Gamma$ be a finite tree, and $\mathcal A$ a Schr\"{o}dinger operator on $\Gamma$. If the…
We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…
The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…
We prove some abstract Wegner bounds for random self-adjoint operators. Applications include elementary proofs of Wegner estimates for discrete and continuous Anderson Hamiltonians with possibly sparse potentials, as well as Wegner bounds…
We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…
The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…
We prove quantitative bounds on the eigenvalues of non-selfadjoint unbounded operators obtained from selfadjoint operators by a perturbation that is relatively-Schatten. These bounds are applied to obtain new results on the distribution of…
In this paper, we investigate the packing parameters in graphs. By applying the Mantel's theorem, We give upper bounds on packing and open packing numbers of triangle-free graphs along with characterizing the graphs for which the equalities…
We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph in terms of its number of vertices, girth, and maximal degree. Equality holds only for Moore graphs, which gives a new characterization of…
One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…
We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…
We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
Tree-width and path-width are well-known graph parameters. Many NP-hard graph problems allow polynomial-time solutions, when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…