Related papers: Norms, Kernels and Eigenvalues of some Infinite Gr…

We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…

We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$-topological-minor free graphs, for an arbitrary fixed graph $H$. This builds on earlier…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…

Can graph neural networks generalize to graphs that are different from the graphs they were trained on, e.g., in size? In this work, we study this question from a theoretical perspective. While recent work established such transferability…

We study the existence and uniqueness of the heat kernel on infinite, locally finite, connected graphs. For general graphs, a uniqueness criterion, shown to be optimal, is given in terms of the maximal valence on spheres about a fixed…

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method is used to approximate isolated eigenvalues. It is shown that entries…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

We propose a novel random walk-based algorithm for unbiased estimation of arbitrary functions of a weighted adjacency matrix, coined universal graph random features (u-GRFs). This includes many of the most popular examples of kernels…

The line graph of a graph $G$ is the graph $L(G)$ whose vertex set is the edge set of $G$ and there is an edge between $e,f\in E(G)$ if $e$ and $f$ share an endpoint in $G$. A graph is called line graph if it is a line graph of some graph.…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

In the classical Hardy space $H^2(\mathbb{D})$, it is well-known that the kernel of the Hankel operator is invariant under the action of shift operator S and sometimes nearly invariant under the action of backward shift operator $S^{*}$. It…

Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite…

Vertex deletion and edge deletion problems play a central role in Parameterized Complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and Chordal Deletion. Interestingly, the study of edge…

In this paper, we introduce the notion of reproducing kernel Hilbert spaces for graphs and the Gram matrices associated with them. Our aim is to investigate the Gram matrices of reproducing kernel Hilbert spaces. We provide several bounds…

We develop two approaches to Quantum (or Non-commutative) Graphs based on arbitrary von Neumann algebras $M\subseteq\mathcal B(H)$: one looking at operator bimodules of Hilbert--Schmidt (instead of bounded) operators, and the second looking…

We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…