相关论文: The Colin de Verdi\`ere Graph Parameter for Thresh…

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 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…

In this paper, we introduce a unified framework of Tensor Higher-Degree Eigenvalue Complementarity Problem (THDEiCP), which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem (QEiCP) for matrices. First,…

In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such theorems are useful in various physical and geometric applications. Our formulas compute the difference of Morse indices of two…

In this paper we consider the eigenvalues and the Seidel eigenvalues of a chain graph. An$\dbar$eli\'{c}, da Fonseca, Simi\'{c}, and Du \cite{andelic2020tridiagonal} conjectured that there do not exist non-isomorphic cospectral chain graphs…

The number of self-adjoint extensions of a symmetric operator acting on a complex Hilbert space is characterized by its deficiency indices. Given a locally finite unoriented simple tree, we prove that the deficiency indices of any discrete…

The k-core of a graph G is the maximal subgraph of G having minimum degree at least k. In 1996, Pittel, Spencer and Wormald found the threshold $\lambda_c$ for the emergence of a non-trivial k-core in the random graph $G(n,\lambda/n)$, and…

We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate…

We say that a first order formula $\Phi$ defines a graph $G$ if $\Phi$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of…

We give combinatorial proofs of some enumeration formulas involving labelled threshold, quasi-threshold, loop-threshold and quasi-loop-threshold graphs. In each case we count by number of vertices and number of components. For threshold…

A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle's theorem, it has been evaded by a series of recent…

We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher…

A super stable tensegrity introduced by Connelly in 1982 is a globally rigid discrete structure made from stiff bars or struts connected by cables with tension. In this paper we show an exact relation between the maximum dimension that a…

We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. Under the…

In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of $D$-cospectral…

We construct multidimensional Schr\"odinger operators with a spectrum that has no gaps at high energies and that is nowhere dense at low energies. This gives the first example for which this widely expected topological structure of the…

It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems in a graph that has at most $k$ vertices whose deletion…

We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…

The aim of this paper is that of discussing Closed Graph Theorems for bornological vector spaces in a way which is accessible to non-experts. We will see how to easily adapt classical arguments of functional analysis over $\mathbb{R}$ and…

In this paper we consider the vector-valued Schr\"{o}dinger operator $-\Delta + V$, where the potential term $V$ is a matrix-valued function whose entries belong to $L^1_{\rm loc}(\mathbb{R}^d)$ and, for every $x\in\mathbb{R}^d$, $V(x)$ is…