相关论文: Minimum supports of eigenfunctions of graphs: a su…

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

In this paper, we obtain a lower bound for the smallest eigenvalue of a regular graph containing many copies of a smaller fixed subgraph. This generalizes a result of Aharoni, Alon, and Berger in which the subgraph is a triangle. We apply…

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

We give a survey of various existence results for minimal Lagrangian graphs. We also discuss the mean curvature flow for Lagrangian graphs.

We study minimax lower bounds for function estimation problems on large graph when the target function is smoothly varying over the graph. We derive minimax rates in the context of regression and classification problems on graphs that…

We describe the eigenvalues and the eigenspaces of the adjacency matrices of subgraphs of the Hamming cube induced by Hamming balls, and more generally, by a union of adjacent concentric Hamming spheres. As a corollary, we extend the range…

We find the exact formula for the minimal number of edges of hypergraph which guaranteed fractional matching of cardinality $s$ in the case when $sn$ is integer.

Spectral radius of a graph $G$ is the largest eigenvalue of adjacency matrix of $G$. The least eigenvalue of a graph $G$ is the least eigenvalue of adjacency matrix of $G$. In this paper we determine the graphs which attain respectively the…

We study the Laplacian on a metrized graph, and its eigenfunctions.

For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs.

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.

An important facet of the inverse eigenvalue problem for graphs is to determine the minimum number of distinct eigenvalues of a particular graph. We resolve this question for the join of a connected graph with a path. We then focus on…

We study certain pairs of subspaces $V$ and $W$ of $\mathbb{C}^n$ we call supports that consist of eigenspaces of the eigenvalues $\pm\|M\|$ of a minimal hermitian matrix $M$ ($\|M\|\leq \|M+D\|$ for all real diagonals $D$). For any pair of…

The sum of the absolute values of the eigenvalues of a graph is called the energy of the graph. We study the problem of finding graphs with extremal energy within specified classes of graphs. We develop tools for treating such problems and…

The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its…

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.