相关论文: On L(2,1)-labelings of some products of oriented c…

An $L(1,1)$-labeling of a graph $G$ is an assignment of labels from $\{0,1 \cdots, k \}$ to the vertices of $G$ such that two vertices that are adjacent or have a common neighbor receive distinct labels. The $\lambda_1^1-$ number,…

We calculate exact values of the decycling numbers of $C_{m} \times C_{n}$ for $m=3,4$, of $C_{n}^{2}$, and of $C_{n}^{3}$.

An $L(d,1)$-labeling of a graph $G$ is an assignment of nonnegative integers to the vertices such that adjacent vertices receive labels that differ by at least $d$ and those at a distance of two receive labels that differ by at least one,…

Suppose that $[n]=\left\{0,1,2,...,n\right\}$ is a set of non-negative integers and $h,k \in [n]$. The $L(h,k)$-labeling of graph $G$ is the function $l:V(G)\rightarrow[n]$ such that $\left|l(u)-l(v)\right|\geq h$ if the distance $d(u,v)$…

We calculate the vacuum polarization functions on the lattice using the overlap fermion formulation.By matching the lattice data at large momentum scales with the perturbative expansion supplemented by Operator Product Expansion (OPE), we…

Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…

Given integers $k,l\geq 2$, where either $l$ is odd or $k$ is even, let $n(k,l)$ denote the largest integer $n$ such that each element of $A_n$ is a product of $k$ many $l$-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev conjectured that…

We focus upon the relationship between Hamiltonian cycle products and efficient vectors for a reciprocal matrix $A$, to more deeply understand the latter. This facilitates a new description of the set of efficient vectors (as a union of…

Given integers $k,l\geq 2$, where either $l$ is odd or $k$ is even, let $n(k,l)$ denote the largest integer $n$ such that each element of $A_n$ is a product of $k$ many $l$-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev proved that if…

An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…

In this paper, the following results are proved: (i) For any odd integer $\ell$ with at most two distinct prime factors and any positive integer $n$, the product $(1^\ell+1)(2^\ell+1)\cdots (n^\ell +1)$ is not a powerful number; (ii) For…

We prove that the cartesian product of octahedra $B_{1,\infty}^{n,m}=B_1^n\times\ldots\times B_1^n$ ($m$ octahedra) is badly approximated by half--dimensional subspaces in mixed--norm: $d_{N/2}(B_{1,\infty}^{n,m},\ell_{2,1}^{n,m})\ge cm$,…

We compute the nonabelian $\mathrm{SL_2}(\mathbb{C})$-character varieties of the rational knots $C(2n+1,2m,2)$ in the Conway notation, where $m$ and $n$ are non-zero integers. By studying real points on these varieties, we determine the…

Let $G=(V,E)$ be a graph and $\Gamma $ an Abelian group both of order $n$. A $\Gamma$-distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow \Gamma $ for which there exists $\mu \in \Gamma $ such that $% \sum_{x\in…

The L(2, 1)-labeling of a digraph G is a function f from the node set of $G$ to the set of all nonnegative integers such that $|f(x)-f(y)| \geq 2$ if $x$ and $y$ are at distance 1, and $f(x)=f(y)$ if $x$ and $y$ are at distance 2, where the…

The heavy baryon \Lambda_{Q} (Q=b or c) can be regarded as composed of a heavy quark and a scalar light diquark which has good spin and isospin quantum numbers. In this picture we establish the Bethe-Salpeter (BS) equation for \Lambda_{Q}…

For the Bergman projection operator $P$ we prove that $ \|P\|_{{L^1(B,d\lambda)\rightarrow B_1}}= \frac {(2n+1)!}{n!}.$ Here $\lambda$ stands for the invariant metric in the unit ball $B$ of $\mathbf{C}^n$, and $B_1$ denotes the Besov space…

We show that the matching book thickness of the Cartesian product of two odd-length cycle-graphs is five if at least one of the cycles has length 3 or 5.

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

Let $\vec C_m$ and $\vec C_n$ be directed cycles of length $m$ and $n$, with $m,n \ge 3$, and let $P(\vec C_m \mathbin{\Box} \vec C_n)$ be the digraph that is obtained from the Cartesian product $\vec C_m \mathbin{\Box} \vec C_n$ by…