Related papers: Waring numbers over finite commutative local rings

We study a generalisation of the bipartite Ramsey numbers to blowups of graphs. For a graph $G$, denote the $t$-blowup of $G$ by $G[t]$. We say that $G$ is $r$-Ramsey for $H$, and write $G \stackrel{r}{\rightarrow} H$, if every…

Let $G=(V,E)$ be a locally finite graph. Firstly, using calculus of variations, including a direct method of variation and the mountain-pass theory, we get sequences of solutions to several local equations on $G$ (the Schr\"odinger…

Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators. For fixed k, we prove that the diameter of said graph is asymptotically (in q) of order q^(1/k). The same also holds when the generating set…

Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…

Let $R$ be a commutative ring and $M$ be an $R$-module, and let $I(R)^*$ be the set of all non-trivial ideals of $R$. The $M$-intersection graph of ideals of $R$, denoted by $G_M(R)$, is a graph with the vertex set $I(R)^*$, and two…

Let $R$ be a commutative ring and ${\Bbb{A}}(R)$ be the set of ideals with non-zero annihilators. The annihilating-ideal graph of $R$ is defined as the graph ${\Bbb{AG}}(R)$ with the vertex set ${\Bbb{A}}(R)^*={\Bbb{A}}\setminus\{(0)\}$ and…

We investigate the relationship between global offensive $k$-alliances and some characteristic sets of a graph including $r$-dependent sets and $\tau$-dominating sets. As a consequence of the study, we obtain bounds on the global offensive…

A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai $k$-coloring is a Gallai coloring that uses $k$ colors. We study Ramsey-type problems in Gallai colorings. Given an integer $k\ge1$ and…

Let G=(V(G),E(G)) be a connected simple graph with n vertices and m edges. A bijection f from the edge set of G to [m] is called a local antimagic labeling of G, if for any two adjacent vertices u and v in G, the sums of the weights of the…

For an ordered subset $W = \{w_1, w_2,\dots w_k\}$ of vertices and a vertex $u$ in a connected graph $G$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $ r(u|W)=(d(v,w_1), d(v,w_2),\dots,$ $d(v,w_k))$, where…

In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…

For $k\in\mathbb{Z}^+$ and $G$ a simple connected graph, a $k$-radio labeling $f:V_G\to\Z^+$ of $G$ requires all pairs of distinct vertices $u$ and $v$ to satisfy $|f(u)-f(v)|\geq k+1-d(u,v)$. When $k=1$, this requirement gives rise to the…

Local random circuits scramble efficiently and accordingly have a range of applications in quantum information and quantum dynamics. With a global $U(1)$ charge however, the scrambling ability is reduced; for example, such random circuits…

In this article, the concept of nil clean graph of a ring has been generalised to weakly nil clean graph of a ring and graph theoretic properties like girth, clique number, diameter and chromatic index of the graph have been studied for a…

In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such Cayley graph…

An $(r,z,k)$-mixed graph $G$ has every vertex with undirected degree $r$, directed in- and out-degree $z$, and diameter $k$. In this paper, we study the case $r=z=1$, proposing some new constructions of $(1,1,k)$-mixed graphs with a large…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…

In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…

The Catalan numbers occur in various counting problems in combinatorics. This paper reveals a connection between the Catalan numbers and list colouring of graphs. Assume $G$ is a graph and $f:V(G) \to N$ is a mapping. For a nonnegative…

The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of GRUNDY COLORING, the problem of determining whether a…