相关论文: A new labeling construction from the $\otimes_h$-p…

The Antimagic Graph Conjecture asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, \dots, |E|$ is used exactly once and the sums of the labels on all edges incident to a given…

It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…

Starting from a graded Frobenius superalgebra $B$, we consider a graphical calculus of $B$-decorated string diagrams. From this calculus we produce algebras consisting of closed planar diagrams and of closed annular diagrams. The action of…

This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…

A magic labeling of a graph is a labeling of the edges by nonnegative integers such that the label sum over the edges incident to every vertex is the same. This common label sum is known as the index. We count magic labelings by maximum…

This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized…

A general procedure which defines a partial ordering of cyclic permutations induced by continuous maps is known for constructing immediate successors to a cycle. We expound on this procedure in terms of labelled digraphs and characteristic…

This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent…

In this paper we introduce a generalization of the well known concept of a graceful labeling. Given a graph G with e=dm edges, we call d-graceful labeling of G an injective function from V(G) to the set {0,1,2,..., d(m+1)-1} such that…

A prime labeling on a graph of order $m$ is an assignment of $\{ 1, 2, \ldots, m \}$ to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The ladder of order $2n$ is the $2 \times n$ grid graph graph…

This note is a continuation of an earlier paper by the authors. We describe improved constructions addressing a question of Erd\H{o}s and Szemer\'edi on sums and products of real numbers along the edges of a graph. We also add a few…

Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…

Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…

We consider higher-order linear-chain conditional random fields (HO-LC-CRFs) for sequence modelling, and use sum-product networks (SPNs) for representing higher-order input- and output-dependent factors. SPNs are a recently introduced class…

Since Sedl\'{a}$\breve{\mbox{c}}$ek introduced the notion of magic labeling of a graph in 1963, a variety of magic labelings of a graph have been defined and studied. In this paper, we study consecutive edge magic labelings of a connected…

The hypergraph product (HGP) is a famous code construction technique with an equally famous canonical visualisation. This visual perspective provides much more than simply a way to build intuition: HGP codes can be defined graphically,…

Semantic role labeling is primarily used to identify predicates, arguments, and their semantic relationships. Due to the limitations of modeling methods and the conditions of pre-identified predicates, previous work has focused on the…

The group $SL(2,\mathbb{C})$ of all complex $2\times 2$ matrices with determinant one is closely related to the group $\boldsymbol{\mathcal{L}}_{+}^\uparrow$ of real $4\times 4$ matrices representing the restricted Lorentz transformations.…

Recent transformer-based approaches demonstrate promising results on relational scientific information extraction. Existing datasets focus on high-level description of how research is carried out. Instead we focus on the subtleties of how…

In the present paper we construct the star products concerning scalar fields in the covariant case from a new approach. We construct the star products at three levels, which are levels of functions on Rd, fields and functionals…