相关论文: Faber-Krahn type inequality for unicyclic graphs

A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very…

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest…

We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…

Given a smooth positive function $f$ defined on the unit circle satisfying a simple condition, we obtain a Poincar\'{e}-type inequality for an arbitrary function $u$ whose weighted average with respect to $f$ is zero. The proof uses…

In this paper, we give a height estimate for constant mean curvature graphs. Using this result we prove two results of uniqueness for the Dirichlet problem associated to the constant mean curvature equation on unbounded domains.

In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…

We consider a solution f of a certain Dirichlet Problem on a domain in $S^{(n+1)}$ whose boundary is a minimal hypersurface and we prove a Poincare type inequality for f. One have equality iff Yau's conjecture about the first non-zero…

In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By…

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

We consider the well-known following shape optimization problem: $$\lambda_1(\Omega^*)=\min_{\stackrel{|\Omega|=a} {\Omega\subset{D}}} \lambda_1(\Omega), $$ where $\lambda_1$ denotes the first eigenvalue of the Laplace operator with…

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

We establish a result of Bombieri-Vinogradov type for the Dirichlet coefficients at prime ideals of the standard $L$-function associated to a self-dual cuspidal automorphic representation $\pi$ of $\mathrm{GL}_n$ over a number field $F$…

We prove that the classical Efron--Stein inequality holds for independent exchangeable pairs \((X_i,Y_i)\). The same inequality fails for independent identically distributed pairs; a simple trigonometric counterexample shows that the…

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…

In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order $n$ with girth and the matching…

We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths…

Choi-Wang obtained a lower bound of the first eigenvalue of the Laplacian on closed minimal hypersurfaces. On minimal hypersurfaces with boundary, Fraser-Li established an inequality giving a lower bound of the first Steklov eigenvalue as a…

We consider graphs for which the non-backtracking matrix has defective eigenvalues, or graphs for which the matrix does not have a full set of eigenvectors. The existence of these values results in Jordan blocks of size greater than one,…

We show that there are minimal graphs in R^{n+1} whose intersection with the portion of the horizontal hyperplane contained in the unit ball has any prescribed geometry, up to a small deformation. The proof hinges on the construction of…