Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed Roman dominating function (NNSRDF) on a graph $G$ is a function $f:V(G)\to \{-1,1,2\}$ satisfying the conditions that (i) $\sum _{x\in N[v]}f(x)\ge 0$ for each $v\in V(G)$, where $N[v]$ is the closed neighborhood of $v$ and (ii)every vertex u for which $f(u)=-1$ has a neighbor v for which $f(v)=2$. The weight of an NNSRDF $f$ is $\omega (f)=\sum _{v\in V(G)}f(v)$. The nonnegative signed Roman domination number ${\gamma }_{sR}^{NN}(G)$ of $G$ is the minimum weight of an NNSRDF $G$ In this paper, we initiate the study of the nonnegative signed Roman domination number of a graph and we present different bounds on ${\gamma }_{sR}^{NN}(G)\ge (8n-12m)/7$. In addition, if $G$ is a bipartite graph of order $n$, then we prove that ${\gamma }_{sR}^{NN}(G){\ge }^{\frac{3}{2}}(\sqrt{4n+9}-3)-n$, and we characterize the external graphs.

We consider inverse-conjugate compositions of a positive integer $n$ in which the parts belong to the residue class of 1 modulo an integer $m>0$. It is proved that such compositions exist only for values of $n$ that belong to the residue class of 1 modulo 2m. An enumerations results is provided using the properties of inverse-conjugate compositions. This work extends recent results for inverse-conjugate compositions with odd parts.

For a graph $G$ and positive integers $a_1,\dots ,a_r,$ if every r-coloring of vertics V(G) must result in a monochromatic $a_1$-clique of color $i$ for some $i\in \{1,\dots ,r\},$ then we write $G\to (a_1,..a_r{)}^v$.$F_v(K_{a}1,\dots ,K_{a}r;H)$ is the smallest integer $n$ such that there is an H-free graph $G$ of order $n$, and $G\to (a_1,\dots ,a_r{)}^v$. In this paper we study upper and lower bounds for some generalized vertex Folkman numbers of from $F_v(K_{a1},\dots ,K_{ar};K_4–e)$, where $r\in 2,3$ and $a_1\in 2,3$ for 10 and $F_v(K_2,K_3;K_4–e)=19$ by computing, and prove $F_v(K_3,K_3;K_4–e)\ge F_v(K_2,K_2,K_3;K_4–e)\ge 25$

We study the complexity of four decision problems dealing with the uniqueness of a solution in a graph: “Uniqueness of a Vertex Cover with bounded size” (U-VC) and “Uniqueness of an Optimal Vertex Cover” (U-OVC), and for any fixed integer $r\ge 1,$ “Uniqueness of an $r$-Dominating Code with bounded size” $(U-D{C}_r)$ and “Uniqueness of an Optimal $r$-Dominating Code” $(U-OD{C}_r$. In particular, we give a polynomial reduction from “Unique Satisfiability of a Boolean formula” (U-SAT) to U-OVC, and from U-SAT to U-ODC, We prove that U-VC and $U-D{C}_r$ have complexity equivalent to that of U-SAT (up to polynomials); consequently, these problems are all $NP$-hard, and U-VC and $U-D{C}_r$ belong to the class $DP$.

Let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Roman dominating function on the digraph $D$ is a function $f:V(D)⟶-1,1,2$ $\sum _{u\in N-(v)}f(u)\ge 1$ for every $v\in V(D)$, where $N^{-}(v)$ consists of all inner neighbors of $v$ for dominating function on $D$ with the property that $\sum _d^{i=1}{f}_i(v)\le 1$ for each $v\in V(D)$ is called a signed total roman dominating family (of functions) on $D$. The maximum number of functions in a signed total roman dominating family on $D$is the signed total Roman domatic number of $D$. denoted by $d_{stR}(D)$. In addition, we determine the signed total Roman domatic number of some digraphs. Some of our results are extensions of well-known properties of the signed total Roman domatic of graphs.

Let $G=(V,E)$ be a graph. The transitivity of a graph $G$, denoted $Tr(G)$, equals the maximum order $k$ of a partition $\pi =\{V_1,V_2,\dots ,V_k\}$ of $V$ such that for r=every $i,j,1\le i<j\le k,V_i$ dominates $V_j$. We consider the transitivity in many special classes of graphs, including cactus graphs, coronas, Cartesian products, and joins. We also consider the effects of vertex or edge deletion and edge addition on the transivity of a graph.

We dedicate this paper to the memory of professor Bohdan Zelinka for his pioneering work on domative of graphs.

The n-dimensional enhanced hypercube $Q_{n,k}(1\le k\le n-1)$ is one of the most attractive interconnection networks for parallel and distributed computing system. Let $H$ be a certain particular connected subgraph of graph $G$. The $H$-structure-connectivity of $G$, denoted by $\kappa (G;H),$ is the cardinality of minimal set of subgraphs $F=\{H_1,H_2,\dots ,H_m\}$ in $G$ such that every $H_i\in F$ is isomprphic to $H$ and $G-F$ is disconnected. The $H$-substructure-connectivity of $G$, denoted by ${}_k^3(G;H)$, is the cardinality of minimal set of subgraphs $F=H_1,H_2,\dots ,H_m$ in $G$ such that every $H_i\in F$ is isomorphic to a connected subgraph $H$ , and $G-F$ is disconnected. Using the structural properties of $Q_{n,k}$ the $H$-structure-connectivity $\kappa (Q_{n,k};H)$ were determine for $H\in \{K_1,K_{1,1},K_{1,2},K_{1,3}\}$.

In this paper, we characterize the set of spanning trees of $G_{n,r}^1$ (a simple connected graph consisting of $n$ edges, containing exactly one 1-edge-connected chain of $r$ cycles ${\mathbb{C}}_r^1$ and $G_{n,r}^1{\mathbb{C}}_r^1$ is a forest). We compute the Hilbert series of the face ring $k[{\mathrm{\Delta }}_s(G_{n,r}^1)]$ for the spanning simplicial complex ${\mathrm{\Delta }}_s(G_{n,r}^1)$. Also, we characterize associated primes of the facet ideal $I_{\mathcal{F}}({\mathrm{\Delta }}_s(G_{n,r}^1)$. Furthermore, we prove that the face ring $k[{\mathrm{\Delta }}_s(G_{n,r}^1)]$ is Cohen-Macaulay.

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset $P$. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points and inducing the poset $P$ on the non-minimal points. It turns out that these counting functions are closely related to a collection of downset numbers of certain subposets. Since any function ar that kind is an exponential sum (with the number of minimal points as exponents), we call it the exponential function of the poset. Some linear equalities, divisibility relations, upper and lower bounds. A list of all such exponential functions for posets with up to five points concludes the paper.

The energy of a graph is defined as the sum of the absolute values of the eigenvalues of its adjacency matrix. The first Zagreb index of a graph is defined as the sum of squares of the degrees of the vertices of the graph. The second Zagreb index of a graph is defined as the sum of products of the degrees of a pairs of the adjacent vertices of the graph. In this paper, we establish some sufficient conditions for a nearly balanced bipartite graph with large minimum degree to be traceable in terms of the energy, the first Zagreb index and the second Zagreb index of the quasi-complement of the graph, respectively.

In $PG(3,P^{2^h}),$ ovoids and cones projecting an oval from a point are characterized as three character sets with respect to lines and planes, respectively.

There are 19 connected cubic graphs of order 10. If $G$ is one of a specific set 3 the 19 graphs. we find necessary and sufficient conditions for the existence of $G$-decompositions of $K_v$.

For a positive integer $k,$ let $[k]=1,2,\dots ,k$, let $P([k])$ denote the power set of the set $[k]$ and let $P\ast ([k])=P([k])–\mathrm{\varnothing }$. For each integer $t$ with $1\le t<k$, let $P_t([k])$ denote the set of $t$-element subsets of $P([k])$. For an edge coloring $c:E(G)\to P_t([k])$ of a graph $G$, where adjacent edges may be colored the same, $c^{\prime }:V(G)\to P\ast ([k])$ is the vertex coloring in which $c^{\prime }(v)$ is the union of the color sets of the edges incident with $v$. If $c^{\prime }$ is a proper vertex coloring of $G$, then $c$ is a majestic $t$-tone k-coloring of $G$ For a fixed positive integer $t$, the minimum positive integer $k$ for which a graph $G$ has a majestic t-tone k-coloring is the majestic t-tone index $ma{j}_t(G)$ of $G$. It is known that if $G$ is a connected bipartite graph or order at least 3, then $ma{j}_t(G)=t+1$ or $ma{j}_t(G)=t+2$ for each positive integer t. It is shown that (i) if $G$ is a 2-connected bipartite graph of arbitrarily large order $n$ whose longest cycles have length $l$ where where $n-5\le l\le n$ and $t\ge 2$ is an integer, then $ma{j}_t(G)=t+1$ and (ii) there is a 2-connected bipartite graph F of arbitrarily large order n whose longest cycles have length n-6 and $ma{j}_2(F)=4$. Furthermore, it is shown for integers $k,t\ge 2$ that there exists a k-connected bipartite graph $G$ such that $ma{j}_t(G)=t+2$. Other results and open questions are also presented.

The 3-path $P_3(G)$ of a connected graph $G$ of order 3 or more has the set of all 3-path (path of order 3) of $G$ as its vertex of $P_3(G)$ are adjacent if they have a 2-path in common. A Hamiltonian walk in a nontrivial connected graph $G$ is a closed walk of minimum length that contains every vertex of $G$. With the aid of spanning trees and Hamiltonian walks in graphs, we provide sufficient conditions for the 3-path graph of a connected graph to be Hamiltonian.

Let $R$ be a commutative ring with identity. For any integer $K>1,$ an element is a $k$ zero divisor if there are $K$ distinct elements including the given one, such that the product of all is zero but the product of fewer than all is nonzero. Let $Z(R,K)$ denote the set of the $K$ zero divisors of $R$. A ring with no $K$-zero divisors is called a $K$-domain. In this paper we define the hyper-graphic constant $HG(R)$ and study some basic properties of $K$-domains. Our main results is theorem 5.1 which is as fellow:

Let $R$ be a commutative ring such that the total ring of fraction $T(R)$ is dimensional. If $R$ is a $K$-domain for $k\ge 2,$ then $R$ has finitely many minimal prime ideals.

Using the results and lemma 5.4, we improve a finiteness theorem proved in [11] to a more robust theorem 5.5 which says:

Suppose $R$ is not a $k$-domain and has more then $k$-minimal prime ideals.

Further, suppose that $T(R)$ is a zero dimensional ring. Then $Z(R,K)$ is finite if and only if $R$ is finite.

We end this paper with a proof of an algorithm describing the maximal $k$-zero divisor hypergraphs on ${\mathbb{Z}}_n$.

The subject matter for this paper is GDDs with three groups of sizes $n_1,n(n\ge n_1)$ and $n+1$, for $n_1=1or2$ and block size four. A block having Configuration $(1,1,2)$ means that the block contains 1 point from two different groups and 2 points from the remaining group. a block having Configuration $(2,2)$ means that the block has exactly two points from two of the three groups. First, we prove that a GDD$(n_1,n,n+1,4;{\lambda }_1,{\lambda }_2)$ for $n_1=1or2$ does not exist if we require that exactly halh of the blocks have the Configuration $(1,1,2)$ and the other half of the blocks have the configuration $(2,2)$ except possibly for n=7 when $n_1=2$. Then we provide necessary conditions for the existence of a GDD$(n_1,n,n+1,4;{\lambda }_1,{\lambda }_2)$ for $n_1=1and2$, and prove that these conditions are sufficient for several families of GDDs. For $n_1=2$, these usual necessary conditions are not sufficient in general as we provide a glimpse of challenges which exist even for the case of $n_1=2$. A general results that a GDD$(n_1,n_2,n_3,4;{\lambda }_1,{\lambda }_2)$ exists if $n_1+n_2+n_3=0,4$ $(mod12)$ is also given.

Recently GDDs with two groups and block size four were studied in a paper where the authors constructed two families out of four possible cases with an equal number of even, odd, and group blocks. In this paper, we prove partial existence of one of the two remaining families, namely $GDD(11t+1,2,4;11t+1,7t)$, with 7 $\nmid$(11t+ 1). In addition, we show a useful construction of $GDD(6t+4,2,4;2,3)$.

A cancellable number (CN) is a fraction in which a decimal digit can be removed (“‘canceled”) in the numerator and denominator without changing the value of the number; examples include $\frac{64}{16}$ where the 6 can be canceled and $\frac{98}{49}$ where the 9 can be canceled. We show that the slope of the line of a cancellable number need not be negative.