Some methods of decomposing $v(=mn)\times b$ incidence matrix of regular group divisible (RGD) designs into square submatrices of order $m$ are described. Such designs are known as tactical decomposable designs. As a by–product, resolvable solutions of some RGD designs are obtained. A relationship between tactical decomposable designs and $(2,n)-$threshold schemes is also given.

Let $G=(V,E,F)$ be a planar graph with vertex set $V$, edge set $E$, and set of faces $F.$ For nonnegative integers $a,b,$ and $c$, a type $(a,b,c)$ face-magic labeling of $G$ is an assignment of $a$ labels to each vertex, $b$ labels to each edge, and $c$ labels to each face from the set of integer labels $\{1,2,\dots a|V|+b|E|+c|F|\}$ such that each label is used exactly once, and for each $s$-sided face $f\in F,$ the sum of the label of $f$ with the labels of the vertices and edges incident with $f$ is equal to some fixed constant ${\mu }_s$ for every $s.$ We find necessary and sufficient conditions for every quadruple $(a,b,c,n)$ such that the $n$-prism graph $Y_n\cong K_2\mathrm{<img\; draggable="false"\; role="img"\; class="emoji"\; alt="◻"\; src="https://s.w.org/images/core/emoji/15.1.0/svg/25fb.svg">}{C}_n$ admits a face-magic labeling of type $(a,b,c)$.

A special type of algebraic intersection graph called the $n$-inordinate invariant intersection graph has been constructed based on the symmetric group, and its structural properties are studied in the literature. In this article, we discuss the different types of dominator coloring schemes of the $n$-inordinate invariant intersection graphs and their complements, $n$-inordinate invariant non-intersection graphs, by obtaining the required coloring pattern and determining the graph invariant associated with the coloring.

Let $G$ be a connected graph and let $d_G$ be the geodesic distance on $V(G)$. The metric spaces $(V(G),d_G)$ were characterized up to isometry for all finite connected $G$ by David C. Kay and Gary Chartrand in 1965. The main result of this paper expands this characterization on infinite connected graphs. We also prove that every metric space with integer distances between its points admits an isometric embedding in $(V(G),d_G)$ for suitable $G$.

MacMahon extensively studied integer compositions, including the notion of conjugation. More recently, Agarwal introduced $n$-color compositions and their cyclic versions were considered by Gibson, Gray, and Wang. In this paper, we develop and study a conjugation rule for cyclic $n$-color compositions. Also, for fixed $\ell$, we identify and enumerate the subset of self-conjugate compositions of $\ell$, as well as establish a bijection between these and the set of cyclic regular compositions of $\ell$ with only odd parts.

The covering cover pebbling number, $\sigma (G)$, of a graph $G$, is the smallest number such that some distribution $D\in \mathcal{K}$ is reachable from every distribution starting with $\sigma (G)$ (or more) pebbles on $G$, where $\mathcal{K}$ is a set of covering distributions. In this paper, we determine the covering cover pebbling number for two families of graphs those do not contain any cycles.

Jeff Remmel introduced the concept of a $\mathit{k}$-11-representable graph in 2017. This concept was first explored by Cheon et al. in 2019, who considered it as a natural extension of word-representable graphs, which are exactly 0-11-representable graphs. A graph $G$ is $k$-11-representable if it can be represented by a word $w$ such that for any edge (resp., non-edge) $xy$ in $G$ the subsequence of $w$ formed by $x$ and $y$ contains at most $k$ (resp., at least $k+1$) pairs of consecutive equal letters. A remarkable result of Cheon et al. is that  any graph is 2-11-representable, while it is still unknown whether every graph is 1-11-representable. Cheon et al. showed that the class of 1-11-representable graphs is strictly larger than that of word-representable graphs, and they introduced a useful toolbox to study 1-11-representable graphs, which was extended by additional powerful tools suggested by Futorny et al. in 2024. In this paper, we prove that all graphs on at most 8 vertices are 1-11-representable hence extending the known fact that all graphs on at most 7 vertices are 1-11-representable. Also, we discuss applications of our main result in the study of multi-1-11-representation of graphs we introduce in this paper analogously to the notion of multi-word-representation of graphs suggested by Kenkireth and Malhotra in 2023.

Topological Indices (TIs) are quantitative measures derived from molecular geometry and are utilized to predict physicochemical properties. Although more than 3000 TIs have been documented in the published literature, only a limited number of TIs have been effectively employed owing to certain limitations. A significant drawback is the higher degeneracy resulting from the lower discriminative power. TIs utilize simple graphs in which atoms and bonds are conceptualized as the vertices and edges of mathematical graphs. As multiple edges are not supported in these graphs, double and triple bonds are considered single. Consequently, the molecular structure undergoes alterations during the conversion process, which ultimately affects the discriminative power. In this investigation, indices for double-bond incorporation were formulated to preserve structural integrity. This study addresses, demonstrates, and verifies a set of double-bonded indices. The indices demonstrated promising results, exhibiting enhanced discriminative power when validated for polycyclic aromatic hydrocarbons using regression analysis. These indices and their potential applications will significantly contribute to QSAR/QSPR studies.

With the rapid development of wireless communication networks, it brings more and more convenience to users. However, with the expansion of network size, the limitation of channel resources in network communication is becoming more obvious. Effective channel assignment has a great impact on the quality of communication networks. However, in real communication networks, underutilization of channels and excessive number of channels produce large interference, so it is necessary to find a reasonable channel assignment method. In this paper, we study the optimal channel assignment strategy for the Cartesian product of an $m$-vertex complete bipartite graph and an $m$-order cycle, where $m\ge 5$ is odd. Determines the exact value and lower bound of its radio number.

This study introduces a novel approach to investigating Sombor indices and applying machine learning methods to assess the similarity of non-steroidal anti-inflammatory drugs (NSAIDs). The research aims to predict the structural similarities of nine commonly prescribed NSAIDs using a machine learning technique, specifically a linear regression model. Initially, Sombor indices are calculated for nine different NSAID drugs, providing numerical representations of their molecular structures. These indices are then used as features in a linear regression model trained to predict the similarity values of drug combinations. The model’s prediction performance is evaluated by comparing the predicted similarity values with the actual similarity values. Python programming is employed to verify accuracy and conduct error analysis.