In this paper, we study further bounds of constant dimension codes in Grassmannian space ${\mathcal{G}}_q(n,k)$. There is increasing interest in subspace codes since they are essential for error-correction in networks. Additionally, there is a connection to the theory over finite fields. By revising the specific construction methods of the constant dimension codes in [1], [2], we improve some bounds on $q$-ary constant dimension codes in certain cases.

In this paper, we use a recent result of Bryant, Horsley, and Pettersson in [1] to provide an alternate and more straightforward proof of results concerning neighborhood graphs in maximum packings of $2K_n$ with triples, some of which were only recently obtained.

To set the stage, consider any partial triple system $(V,B)$ of $2K_n$. In this system, the neighborhood of a vertex $v$ is defined as the subgraph induced by the set $\{\{x,y\}\mid \{v,x,y\}\in B\}$. This concept plays a crucial role in the results initially obtained by Colbourn and Rosa for $n\equiv 0,1(\mathrm{mod}3)$ and by Chaffee and Rodger for $n\equiv 2(\mathrm{mod}3)$. These results offer a complete characterization of the possible neighborhoods in a maximum packing of $2K_n$.

In both of these original papers, the authors employed difference methods—a combinatorial technique that often involves selecting pairs of elements from a group and studying their differences—and a pull-up technique, which is used to modify the neighborhood of a vertex. However, despite the effectiveness of these methods, neither approach seems to lend itself easily to deriving the results of the other.

In our paper, we present a more unified and simplified proof that brings both of these results together. By leveraging the recent findings of Bryant, Horsley, and Pettersson, we can bypass the need for the more complex difference methods and pull-up techniques, instead relying on the underlying principles elucidated in their work. This approach not only simplifies the proof process but also provides a clearer and more direct route to understanding the structure of neighborhood graphs in these maximum packings.

Compressed sensing (CS) has broken through the traditional Nyquist sampling theory as it is a new technique in signal processing. According to CS theory, compressed sensing makes full use of sparsity so that a sparse signal can be reconstructed from very few measurements. It is well known that the construction of CS matrices is the central problem. In this paper, we provide one kind of deterministic sensing matrix by describing a combinatorial design. Then, we obtain two cases by instantiating the RIP framework with the obtained design, with the latter case being the majorization of the former. Finally, we show that our construction has better properties than DeVore’s construction using polynomials over finite fields.

In this paper, with the help of the residue method, we find some interesting formulas relating residue and ordinary Bell polynomials, ${\hat{B}}_{n,k}(x_1,x_2,\dots )$. Further, we prove identities involving some combinatorial numbers to demonstrate the application of the formulas.

We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of pebbles on the vertices. Player one wins if, through a series of pebbling moves, he can move at least one pebble to the target. A pebbling move of $p$ pebbles across an edge with weight $w$ leaves $\lfloor pw\rfloor$ pebbles on the next vertex. We find the weighted pebbling numbers of stars, graphs with at least $2|V|-1$ edges, and trees with given targets. We give an explicit formula for the minimum total weight required on the edges of a length-2 path, solvable with $p$ pebbles, and exhibit a graph that requires an edge with weight $1/3$ in order to achieve its weighted pebbling number.

We examine two particular constructions of Costas arrays known as the Taylor variant of the Lempel construction, or the $T_4$ construction, and the variant of the Golomb construction, or the $G_4$ construction. We connect these with Fibonacci primitive roots, and show that under the Extended Riemann Hypothesis, the $T_4$ and $G_4$ constructions are valid infinitely often.

The authentication codes with arbitration are said to be $A^2$-codes. Two constructions of $A^2$-codes with secrecy from polynomials over finite fields are constructed to prevent communication systems from attacks which come from the opponent, the transmitter and the receiver. Parameters of the codes and probabilities of successful attacks are also computed. At last, two constructions are compared with a known one. It is important that a source state can’t be recovered from the message without the knowledge of the transmitter’s encoding rule or the receiver’s decoding rule. It must be decoded before verification.

For $n\ge 1$, we let $a_n$ count the number of nonempty subsets $S$ of $\{1,2,3,\dots ,n\}=[n]$, where the size of $S$ equals the minimal element of $S$. Such a subset is called an extraordinary subset of $[n]$, and we find that $a_n=F_n$, the $n$th Fibonacci number. Then, for $n\ge k\ge 1$, we let $a(n,k)$ count the number of times the integer $k$ appears among these $a_n$ extraordinary subsets of $n$. Here we have $a(n,k)=a(n-1,k)+a(n-2,k-1)$, for $n\ge 3$ and $n>k\ge 2$. Formulas and properties for $t_n=\sum _{k=1}^{n}a(n,k)$ and $s_n=\sum _{k=1}^{n}ka(n,k)$ are given for $n\ge 1$. Finally, for fixed $n\ge 1$, we find that the sequence $a(n,k)$ is unimodal and examine the maximum element for the sequence. In this context, the Catalan numbers make an entrance.

The cycle length distribution (CLD) of a graph of order $n$ is $(c_1,c_2,\dots ,c_n)$, where $c_i$ is the number of cycles of length $i$, for $i=1,2,\dots ,n$. For an integer sequence $(a_1,a_2,\dots ,a_n)$, we consider the problem of characterizing those graphs $G$ with the minimum possible edge number and with $\text{CLD}(G)=(c_1,c_2,\dots ,c_n)$ such that $c_i\ge a_i$ for $i=1,2,\dots ,n$. The number of edges in such a graph is denoted by $g(a_1,a_2,\dots ,a_n)$. In this paper, we give the lower and upper bounds of $g(0,0,k,\dots ,k)$ for $k=2,3,4$.

Two-fold automorphisms (or “TF-isomorphisms”) of graphs are a generalisation of automorphisms. Suppose $\alpha ,\beta$ are two permutations of $V=V(G)$ such that for any pair $(u,v)$, $u,v\in V$, $(u,v)$ is an arc of $G$ if and only if $(\alpha (u),\beta (v))$ is an arc of $G$. Such a pair of permutations is called a two-fold automorphism of $G$. These pairs form a group that is called the two-fold automorphism group. Clearly, it contains all the pairs $(\alpha ,\alpha )$ where $\alpha$ is an automorphism of $G$. The two-fold automorphism group of $G$ can be larger than $\text{Aut}(G)$ since it may contain pairs $(\alpha ,\beta )$ with $\alpha \ne \beta$. It is known that when this happens, $\text{Aut}(G)\times {\mathbb{Z}}_2$ is strictly contained in $\text{Aut}(G\times K_2)$. In the literature, when this inclusion is strict, the graph $G$ is called unstable.

Now let $\mathrm{\Gamma }\le S_V\times S_V$. A two-fold orbital (or “TF-orbital”) of $F$ is an orbit of the action $(\alpha ,\beta ):(u,v)\mapsto (\alpha (u),\beta (v))$ for $(\alpha ,\beta )\in \mathrm{\Gamma }$ and $u,v\in V$. Clearly, $\mathrm{\Gamma }$ is a subgroup of the TF-automorphism group of any of its TF-orbitals. We give a short proof of a characterization of TF-orbitals which are disconnected graphs and prove that a similar characterization of TF-orbitals which are digraphs might not be possible. We shall also show that the TF-rank of $\mathrm{\Gamma }$, that is the number of its TF-orbitals, can be equal to $1$ and we shall obtain necessary and sufficient conditions on I for this to happen.

We define a new fairness notion on edge-colorings, requiring that the number of vertices in the subgraphs induced by the edges of each color are within one of each other. Given a (not necessarily proper) $k$-edge-coloring of a graph $G$, for each color $i\in {\mathbb{Z}}_k$, let $G[i]$ denote the (not necessarily spanning) subgraph of $G$ induced by the edges colored $i$. Let ${\nu }_i(G)=|V(G[i])|$. Formally, a $k$-edge-coloring of a graph $G$ is said to be vertex-equalized if for each pair of colors $i,j\in {\mathbb{Z}}_k$, $|{\nu }_i(G)–{\nu }_j(G)|\le 1$. In this paper, a characterization is found for connected graphs that have vertex-equalized $k$-edge-colorings for each $k\in \{2,3\}$ (see Corollary 4.1 and Corollary 4.2).

Let $G=(V,E)$ be a graph. The open neighborhood of a vertex $v\in V$ is the set $N(v)=\{u\mid uv\in E\}$ and the closed neighborhood of $v$ is the set $N[v]=N(v)\cup \{v\}$. The open neighborhood of a set $S$ of vertices is the set $N(S)=\bigcup _{v\in S}N(v)$, while the closed neighborhood of a set $S$ is the set $N[S]=\bigcup _{v\in S}N[v]$. A set $S\subset V$ dominates a set $T\subset V$ if $T\subseteq N[S]$, written $S\to T$. A set $S\subset V$ is a dominating set if $N[S]=V$; and is a minimal dominating set if it is a dominating set, but no proper subset of $S$ is also a dominating set; and is a $\gamma$-set if it is a dominating set of minimum cardinality. In this paper, we consider the family $\mathcal{D}$ of all dominating sets of a graph $G$, the family $\mathcal{M}\mathcal{D}$ of all minimal dominating sets of a graph $G$, and the family $\mathrm{\Gamma }$ of all $\gamma$-sets of a graph $G$. The study of these three families of sets provides new characterizations of the distance-2 domination number, the upper domination number, and the upper irredundance number in graphs.

Irregular-spotty-byte error control codes were devised by the author in [2] and their properties were further studied in [3] and [4]. These codes are suitable for semi-conductor memories where an I/O word is divided into irregular bytes not necessarily of the same length. The $i$-spotty-byte errors are defined as $t_i$ or fewer bit errors in an $i$-byte of length $n_i$, where $1\le t_i\le n_i$ and $1\le i\le s$. However, an important and practical situation is when $i$-spotty-byte errors caused by the hit of high energetic particles are confined to $i$-bytes of the same size only which are aligned together or in words errors occur usually in adjacent RAM chips at a particular time. Keeping this view, in this paper, we propose a new model of $i$-spotty-byte errors, viz. uniform $i$-spotty-byte errors and present a new class of codes, viz. uniform $i$-spotty-byte error control codes which are capable of correcting all uniform $i$-spotty-byte errors of $i$-spotty measure $\mu$ (or less). The study made in this paper will be helpful in designing modified semi-conductor memories consisting of irregular RAM chips with those of equal length aligned together.

Let $\mathcal{M}$ denote the set of matrices over some semiring. An upper ideal of matrices in $\mathcal{M}$ is a set $\mathcal{U}$ such that if $A\in \mathcal{U}$ and $B$ is any matrix in $\mathcal{M}$, then $A+B\in \mathcal{U}$. We investigate linear operators that strongly preserve certain upper ideals (that is, linear operators on $\mathcal{M}$ with the property that $X\in \mathcal{U}$ if and only if $T(X)\in \mathcal{U}$). We then characterize linear operators that strongly preserve sets of tournament matrices and sets of primitive matrices. Specifically, we show that if $T$ strongly preserves the set of regular tournaments when $n$ is odd or nearly regular tournaments when $n$ is even, then for some permutation matrix $P$, $T(X)=P^{t}XP$ for all matrices $X$ with zero main diagonal, or $T(X)=P^t{X}^{t}P$ for all matrices $X$ with zero main diagonal. Similar results are shown for linear operators that strongly preserve the set of primitive matrices whose exponent is $k$ for some values of $k$, and for those that strongly preserve the set of nearly reducible primitive matrices.

For a poset $P=(V(P),{\le }_P)$, the strict semibound graph of $P$ is the graph $ssb(P)$ on $V(ssb(P))=V(P)$ for which vertices $u$ and $v$ of $ssb(P)$ are adjacent if and only if $u\ne v$ and there exists an element $x\in V(P)$ distinct from $u$ and $v$ such that $x{\le }_{P}u,v$ or $u,v{\le }_{P}x$. We prove that a poset $P$ is connected if and only if the induced subgraph $⟨max(P){⟩}_{ssb(P)}$ is connected. We also characterize posets whose strict semibound graphs are triangle-free.

In this paper, we revisit LE graphs, find the minimum $\lambda$ for decomposition of $\lambda K_n$ into these graphs, and show that for all viable values of $\lambda$, the necessary conditions are sufficient for LE-decompositions using cyclic decompositions from base graphs.

We determine the signless Laplacian spectrum for the $H$-join of regular graphs $G_1,\dots ,G_p$. We also find an expression and upper bounds for the signless Laplacian spread of the $H$-join of regular graphs $G_1,\dots ,G_p$.

Placing degree constraints on the vertices of a path yields the definitions of uphill and downhill paths. Specifically, we say that a path $\pi =v_1,v_2,\dots ,v_{k+1}$ is a downhill path if for every $i$, $1\le i\le k$, $\mathrm{deg}(v_i)\ge \mathrm{deg}(v_{i+1})$. Conversely, a path $\pi =u_1,u_2,\dots ,u_{k+1}$ is an uphill path if for every $i$, $1\le i\le k$, $\mathrm{deg}(u_i)\le \mathrm{deg}(u_{i+1})$. The downhill domination number of a graph $G$ is defined to be the minimum cardinality of a set $S$ of vertices such that every vertex in $V$ lies on a downhill path from some vertex in $S$. The uphill domination number is defined as expected. We explore the properties of these invariants and their relationships with other invariants. We also determine a Vizing-like result for the downhill (respectively, uphill) domination numbers of Cartesian products.

Set-to-Set Broadcasting is an information distribution problem in a connected graph, $G=(V,E)$, in which a set of vertices $A$, called originators, distributes messages to a set of vertices $B$ called receivers, such that by the end of the broadcasting process each receiver has received the messages of all the originators. This is done by placing a series of calls among the communication lines of the graph. Each call takes place between two adjacent vertices, which share all the messages they have. Gossiping is a special case of set-to-set broadcasting, where $A=B=V$. We use $F(A,B,G)$ to denote the length of the shortest sequence of calls that completes the set-to-set broadcast from a set $A$ of originators to a set $B$ of receivers, within a connected graph $G$. $F(A,B,G)$ is also called the cost of an algorithm. We present bounds on $F(A,B,G)$ for weighted and for non-weighted graphs.

Let ${\gamma }_c(G)$ denote the connected domination number of the graph $G$. A graph $G$ is said to be connected domination edge critical, or simply ${\gamma }_c$-critical, if ${\gamma }_c(G+e)<{\gamma }_c(G)$ for each edge $e\in E(\overline{G})$. We answer a question posed by Zhao and Cao concerning ${\gamma }_c$-critical graphs with maximum diameter.