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\geq 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.

Total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph. Here, we will find the total dominator chromatic numbers of wheels, complete bipartite graphs and complete graphs.

We initiate to study a \(D\)-irregular labeling, which generalizes both non-inclusive and inclusive \(d\)-distance irregular labeling of graphs. Let \(G=(V(G),E(G))\) be a graph, \(D\) a set of distances, and \(k\) a positive integer. A mapping \(\varphi\) from \(V(G)\) to the set of positive integers \(\{1,2,\dots,k\}\) is called a \(D\)-irregular \(k\)-labeling of \(G\) if every two distinct vertices have distinct weights, where the weight of a vertex \(x\) is defined as the sum of labels of vertices whose distance from \(x\) belongs to \(D\). The least integer \(k\) for which \(G\) admits a \(D\)-irregular labeling is the \(D\)-irregularity strength of \(G\) and denoted by \(\mathrm{s}_D(G)\). In this paper, we establish several fundamental properties on \(D\)-irregularity strength for arbitrary graphs. We also determine this parameter exactly for families of graphs with small diameter or small maximum degree.

A proper coloring assigns distinct colors to the adjacent vertices of a graph. An equitable near proper coloring of a graph \(G\) is an improper coloring in which neighbouring vertices are allowed to receive the same color such that the cardinalities of two distinct color classes differ by not more than one and the number of monochromatic edges is minimised by giving certain restrictions on the number of color classes that can have an edge between them. This paper discusses the equitable near proper coloring of line, middle, and total graphs of certain graph classes, such as paths, cycles, sunlet graphs, star graphs, and gear graphs.

Directed hypergraphs represent a natural extension of directed graphs, while soft set theory provides a method for addressing vagueness and uncertainty. This paper introduces the notion of soft directed hypergraphs by integrating soft set principles into directed hypergraphs. Through parameterization, soft directed hypergraphs yield a sequence of relation descriptions derived from a directed hypergraph. Additionally, we present several operations for soft directed hypergraphs, including extended union, restricted union, extended intersection, and restricted intersection, and explore their characteristics.

For a connected graph \(G\), the edge Mostar index \(Mo_e(G)\) is defined as \(Mo_e(G)=\sum\limits_{e=uv \in E(G)}|m_u(e|G) – m_v(e|G)|\), where \(m_u(e|G)\) and \(m_v(e|G)\) are respectively, the number of edges of \(G\) lying closer to vertex \(u\) than to vertex \(v\) and the number of edges of \(G\) lying closer to vertex \(v\) than to vertex \(u\). We determine a sharp upper bound for the edge Mostar index on bicyclic graphs and identify the graphs that achieve the bound, which disproves a conjecture proposed by Liu et al. [Iranian J. Math. Chem. 11(2) (2020) 95–106].

Given a connected graph \(G\) and a configuration \(D\) of pebbles on the vertices of \(G\), a pebbling transformation involves removing two pebbles from one vertex and placing one pebble on its adjacent vertex. A monophonic path is defined as a chordless path between two non-adjacent vertices \(u\) and \(v\). The monophonic cover pebbling number, \(\gamma_{\mu}(G)\), is the minimum number of pebbles required to ensure that, after a series of pebbling transformations using monophonic paths, all vertices of \(G\) are covered with at least one pebble each. In this paper, we determine the monophonic cover pebbling number (\(MCPN\)) for the gear graph, sunflower planar graph, sun graph, closed sun graph, tadpole graph, lollipop graph, double star-path graph, and a class of fuses.

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial identities (Theorems 3.1 and 3.3) are established as applications, that contain some well–known convolution formulae on Stirling numbers as special cases.

For a graph G and for non-negative integers p, q, and r, the triplet \((p, q, r)\) is said to be an admissible triplet if \(3p + 4q + 6r = |E(G)|\). If G admits a decomposition into p cycles of length 3, q cycles of length 4, and r cycles of length 6 for every admissible triplet \((p, q, r)\), then we say that G has a \(\{C_{3}^{p}, C_{4}^{q}, C_{6}^{r}\}\)-decomposition. In this paper, the necessary conditions for the existence of \(\{C_{3}^{p}, C_{4}^{q}, C_{6}^{r}\}\)-decomposition of \(K_{\ell, m, n} (\ell \leq m \leq n)\) are proved to be sufficient. This affirmatively answers the problem raised in Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Discrete Math. 197/198 (1999), 123-135. As a corollary, we deduce the main results of Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Discrete Math., 197/198, 123-135 (1999) and Decompositions of complete tripartite graphs into cycles of lengths 3 and 6, Austral. J. Combin., 73(1), 220-241 (2019).