Related papers: Can One Hear the Shape of a Graph?
The subject of the paper are Schr\"odinger operators on tree graphs which are radial having the branching number $b_n$ at all the vertices at the distance $t_n$ from the root. We consider a family of coupling conditions at the vertices…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
This review paper summarizes the contents of the talk given by the author at the 8th International Congress of Chinese Mathematicians. Using examples of Schr\"odinger operators on metric graphs, it is shown that a nontrivial topology of the…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
We investigate the particle trapping and scattering properties in a tight-binding network which consists of several subgraphs. The particle trapping condition is proved under which particles can be trapped in a subgraph without leaking.…
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…
We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…
We consider a semi-periodic two-dimensional Schr\"odinger operator which is cut at an angle. When the cut is commensurate with the periodic lattice, the spectrum of the operator has the band-gap Bloch structure. We prove that in the…
In this paper, we study how the distance spectral radius behaves when the graph is perturbed by grafting edges. As applications, we also determine the graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal distance…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
This work is a continuation and extension of the note published in the Russian Math Surveys 1997 n 6. For any pair of solutions of the spectral problem for the second order selfadjoint real Schrodinger Operator on the graph their Symplectic…
We prove that the presence or absence of corners is spectrally determined in the following sense: any simply connected domain with piecewise smooth Lipschitz boundary cannot be isospectral to any connected domain, of any genus, which has…
We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary length. The implications of our results to the structural and dynamical properties of networks…
It is proven that the absolutely continuous spectrum of matrix Schr\"{o}dinger operators coincides (with the multiplicity taken into account) with the spectrum of the unperturbed operator if the (matrix) potential is square integrable. The…
The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…
We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…
Spectral properties of Schr\"odinger operators on compact metric graphs are studied and special emphasis is put on differences in the spectral behavior between different classes of vertex conditions. We survey recent results especially for…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…