Related papers: A Structured Inverse Spectrum Problem for Infinite…

In this paper, we investigate power-bounded operators, including surjective isometries, on Banach spaces. Koehler and Rosenthal asserted that an isolated point in the spectrum of a surjective isometry on a Banach space lies in the point…

Consider the Jacobi operators $\cJ$ given by $(\cJ y)_n=a_ny_{n+1}+b_ny_n+a_{n-1}^*y_{n-1}$, $y_n\in \C^m$ (here $y_0=y_{p+1}=0$), where $b_n=b_n^*$ and $a_n:\det a_n\ne 0$ are the sequences of $m\ts m$ matrices, $n=1,..,p$. We study two…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…

In this paper, we treat some weighted line digraphs which are induced by a connected and undirected graph. For a given graph $G$, the adjacency matrix of the weighted line digraph $W$ is determined by a boundary operator from an arc-based…

We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

For a locally finite, connected graph $\Gamma$, let $\operatorname{Map}(\Gamma)$ denote the group of proper homotopy equivalences of $\Gamma$ up to proper homotopy. Excluding sporadic cases, we show $\operatorname{Aut}(S(M_\Gamma)) \cong…

We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…

Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…

We present results on the unique reconstruction of a semi-infinite Jacobi operator from the spectra of the operator with two different boundary conditions. This is the discrete analogue of the Borg-Marchenko theorem for Schr{\"o}dinger…

In this paper, we give an example of a closed unbounded operator whose square's domain and adjoint's square domain are equal and trivial. Then, we come up with an essentially self-adjoint whose square has a trivial domain.

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…

A \emph{long unichord} in a graph is an edge that is the unique chord of some cycle of length at least 5. A graph is \emph{long-unichord-free} if it does not contain any long-unichord. We prove a structure theorem for long-unichord-free…