Let \( k \) be a positive integer, and let \( G \) be a simple graph with vertex set \( V(G) \). A function \( f: V(G) \to \{\pm1, \pm2, \ldots, \pm k\} \) is called a signed \(\{k\}\)-dominating function if

\[ \sum_{u \in N[v]} f(u) \geq k \]

for each vertex \( v \in V(G) \).

The signed \(\{1\}\)-dominating function is the same as the ordinary signed domination. A set \( \{f_1, f_2, \ldots, f_d\} \) of signed \(\{k\}\)-dominating functions on \( G \) with the property that

\[ \sum_{i=1}^d f_i(v) \leq k \]

for each \( v \in V(G) \), is called a \emph{signed \(\{k\}\)-dominating family} (of functions) on \( G \). The maximum number of functions in a signed \(\{k\}\)-dominating family on \( G \) is the \emph{signed \(\{k\}\)-domatic number} of \( G \), denoted by \( d_{\{k\}S}(G) \). Note that \( d_{\{1\}S}(G) \) is the classical signed domatic number \( d_s(G) \).

In this paper, we initiate the study of signed \(\{k\}\)-domatic numbers in graphs, and we present some sharp upper bounds for \( d_{\{k\}S}(G) \). In addition, we determine \( d_{\{k\}S}(G) \) for several classes of graphs. Some of our results are extensions of known properties of the signed domatic number.

A graceful \( n \)-permutation is a graceful labeling of an \( n \)-vertex path \( P_n \). In this paper, we improve the asymptotic lower bound on the number of such permutations from \( \Omega\left(\left(\frac{5}{3}\right)^n\right) \) to \( \Omega\left(2.37^n\right) \). This is a computer-assisted proof based on an effective algorithm that enumerates graceful \( n \)-permutations. Our algorithm is also presented in detail.

Let \( K_{r+1} \) be the complete graph on \( r+1 \) vertices and let \( \pi = (d_1, d_2, \ldots, d_n) \) be a non-increasing sequence of nonnegative integers. If \( \pi \) has a realization containing \( K_{r+1} \) as a subgraph, then \( \pi \) is said to be potentially \( K_{r+1} \)-graphic. A.R. Rao obtained an Erdős-Gallai type criterion for \( \pi \) to be potentially \( K_{r+1} \)-graphic. In this paper, we provide a simplification of this Erdős-Gallai type criterion. Additionally, we present the Fulkerson-Hoffman-McAndrew type criterion and the Hasselbarth type criterion for \( \pi \) to be potentially \( K_{r+1} \)-graphic.

In this paper, we introduce several concepts related to fuzzy algebraic structures. We provide an example of a fuzzy binary operation and a fuzzy group. Additionally, we define a new fuzzy binary operation on a \(\Gamma\)-ring \(M\) and introduce a new fuzzy \(\Gamma\)-ring. We also present homomorphism theorems between two fuzzy \(\Gamma\)-rings and investigate some related properties.

Let \( R \) be a commutative ring and \( Z(R) \) be its set of all zero-divisors. The \emph{total graph} of \( R \), denoted by \( T_\Gamma(R) \), is the undirected graph with vertex set \( R \), where two distinct vertices \( x \) and \( y \) are adjacent if and only if \( x + y \in Z(R) \).

In this paper, we obtain a lower bound as well as an upper bound for the domination number of \( T_\Gamma(R) \). Further, we prove that the upper bound for the domination number of \( T_\Gamma(R) \) is attained in the case of an Artin ring \( R \). Having established this, we identify certain classes of rings for which the domination number of the total graph equals this upper bound.

In view of these results, we conjecture that the domination number of \( T_\Gamma(R) \) is always equal to this upper bound. We also derive certain other domination parameters for \( T_\Gamma(R) \) under the assumption that the conjecture is true.

For given graphs \( H_1 \) and \( H_2 \), the \emph{Ramsey number} \( R(H_1, H_2) \) is the smallest positive integer \( n \) such that if we arbitrarily color the edges of the complete graph \( K_n \) with two colors, 1 (red) and 2 (blue), then there is a monochromatic copy of \( H_1 \) colored with 1 or \( H_2 \) colored with 2.

We show that if \( n \) is even, \( q = \lceil \sqrt{n} \rceil \) is odd, and \( s = n – (q-1)^2 \leq \frac{q}{2} \), then \( R(K_{2,2}, K_{2,n}) \leq n + 2q – 1 \), where \( K_{n,m} \) are complete bipartite graphs. This bound provides the exact value of \( R(K_{2,2}, K_{2,18}) = 27 \). Moreover, we show that \( R(K_{2,2}, K_{2,14}) = 22 \) and \( R(K_{2,2}, K_{2,15}) = 24 \).

A \emph{red-blue coloring} of a graph \( G \) is an edge coloring of \( G \) in which every edge is colored red or blue. For a connected graph \( H \) of size at least 2, a \emph{color frame} \( F \) of \( H \) is obtained from a red-blue coloring of \( H \) having at least one edge of each color and in which a blue edge is designated as the root edge.

An \( F \)-coloring of a graph \( G \) is a red-blue coloring of \( G \) in which every blue edge of \( G \) is the root edge of a copy of \( F \) in \( G \), and the \( F \)-\emph{chromatic index} of \( G \) is the minimum number of red edges in an \( F \)-coloring of \( G \). An \( F \)-coloring of \( G \) is \emph{minimal} if whenever any red edge of \( G \) is changed to blue, then the resulting red-blue coloring of \( G \) is not an \( F \)-coloring of \( G \). The maximum number of red edges in a minimal \( F \)-coloring of \( G \) is the \emph{upper \( F \)-chromatic index} of \( G \).

In this paper, we investigate \( F \)-colorings and \( F \)-chromatic indexes of graphs for all color frames \( F \) of paths of orders 3 and 4.

A set of vertices \( S \) in a graph \( G \) is a dominating set if any vertex of \( G – S \) is adjacent to some vertex in \( S \). The domination number, \( \gamma(G) \), of \( G \) is the minimum cardinality of a dominating set of \( G \).

The subdivision of an edge \( uv \) is the operation of replacing \( uv \) with a path \( uwv \) through a new vertex \( w \). A graph \( G \) is domination critical upon edge subdivision if the domination number increases by subdivision of any edge.

In this paper, we study domination critical graphs upon edge subdivision. We present several properties and bounds for these graphs and then give a constructive characterization of domination critical trees upon edge subdivision.

Let \( G \) be a graph of order \( n \). The \emph{binding number} of \( G \) is defined as

\[
\text{bind}(G) := \min \left\{ \frac{|N_G(X)|}{|X|} \mid \emptyset \neq X \subseteq V(G) \text{ and } N_G(X) \neq V(G) \right\}.
\]

A \((g, f)\)-factor is called a connected \((g, f)\)-factor if it is connected. A \((g, f)\)-factor \( F \) is called a Hamilton \((g, f)\)-factor if \( F \) contains a Hamilton cycle. In this paper, several sufficient conditions related to binding number and minimum degree for graphs to have connected \((g, f+1)\)-factors or Hamilton \((g, f)\)-factors are given.

Define an edge \( Q_1Q_2 \) or a triangle \( Q_1Q_2Q_3 \) of a clique graph \( K(G) \) to be weight-\( k \) if \( |Q_1 \cap Q_2| \geq k \) or \( |Q_1 \cap Q_2 \cap Q_3| \geq k \), respectively. A graph \( G \) is shown to be strongly chordal if and only if, for every \( k \geq 1 \), every cycle of weight-\( k \) edges in \( K(G) \) either has a weight-\( k \) chord or is a weight-\( k \) triangle—this mimics the usual definition of chordal graphs. Similarly, trivially perfect graphs have a characterization that mimics a simple characterization of component-complete graphs.