相关论文: Neighbors, neighbor graphs and invariant rings in …

We continue our investigation of the modular graph functions and string invariants that arise at genus-two as coefficients of low energy effective interactions in Type II superstring theory. In previous work, the non-separating degeneration…

This article is a continuation of our recent work (Yin Chen and Runxuan Zhang, Shape enumerators of self-dual NRT codes over finite fields. SIAM J. Discrete Math. 38 (2024), no. 4, 2841-2854) in the setting of quantum error-correcting…

We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…

The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…

This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…

Deep connections between invariant theory and entanglement have been known for some time and been the object of intense study. This includes the study of local unitary equivalence of density operators as well as entanglement that can be…

In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive…

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…

Let $f: V(G)\cup E(G)\rightarrow \{1,2,\dots,k\}$ be a non-proper total $k$-coloring of $G$. Define a weight function on total coloring as $$\phi(x)=f(x)+\sum\limits_{e\ni x}f(e)+\sum\limits_{y\in N(x)}f(y),$$ where $N(x)=\{y\in V(G)|xy\in…

We define the graph minor category and prove that the category of contravariant representations of the graph minor category over a Noetherian ring is locally Noetherian. This can be regarded as a categorification of the Robertson--Seymour…

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

Binary code similarity detection is an important problem with applications in areas such as malware analysis, vulnerability research and license violation detection. This paper proposes a novel graph neural network architecture combined…

We consider the extremal family of graphs of order $2^n$ in which no two vertices have identical neighbourhoods, yet the adjacency matrix has rank only $n$ over the field of two elements. A previous result from algebraic geometry shows that…

The idea that those different from you are "unfriendly" is captured in the definition of unfriendly 2-colorings in graph theory in a paper by Aharoni, Milner and Prikry, where they prove that every finite graph has an unfriendly coloring.…

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

The neighborhood polynomial of graph $G$, denoted by $N(G,x)$, is the generating function for the number of vertex subsets of $G$ which are subsets of open neighborhoods of vertices in $G$. For any graph polynomial, it can be useful to…

Nebe, Rains and Sloane studied the polynomial invariants for real and complex Clifford groups and they relate the invariants to the space of complete weight enumerators of certain self-dual codes. The purpose of this paper is to show that…

We extend the graph convolutional network method for deep learning on graph data to higher order in terms of neighboring nodes. In order to construct representations for a node in a graph, in addition to the features of the node and its…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…

We derive the distribution of the maximum number of common neighbours of a pair of vertices in a dense random regular graph.The proof involves two important steps. One step is to establish the extremal independence property: the asymptotic…