Let \(G\) be a graph with vertex set \(V(G)\) and let \(f\) be a nonnegative integer-valued function defined on \(V(G)\). A spanning subgraph \(F\) of \(G\) is called a fractional \(f\)-factor if \(d_G^{h}(x) = f(x)\) for every \(x \in V(F)\). In this paper, we prove that if \(\delta(G) \geq b\) and \(\alpha(G) \leq \frac{4a(\delta-b)}{(b+1)^2}\), then \(G\) has a fractional \(f\)-factor. Where \(a\) and \(b\) are integers such that \(0 \leq a \leq f(x) \leq b\) for every \(x \in V(G)\). Therefore, we prove that the fractional analogue of Conjecture in \([2]\) is true.

Let \(D\) be a connected symmetric digraph, \(A\) a finite abelian group, \(g \in A\) and \(\Gamma\) a group of automorphisms of \(D\). We consider the number of \(T\)-isomorphism classes of connected \(g\)-cyclic \(A\)-covers of \(D\) for an element \(g\) of odd order. Specifically, we enumerate the number of \(I\)-isomorphism classes of connected \(g\)-cyclic \(A\)-covers of \(D\) for an element \(g\) of odd order and the trivial automorphism group \(\Gamma\) of \(D\), when \(A\) is the cyclic group \({Z}_{p^n}\) and the direct sum of \(m\) copies of \({Z}_p\) for any prime number \(p (> 2)\).

The Grundy number of an impartial game \(G\) is the size of the unique Nim heap equal to \(G\). We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a player may remove from a heap in terms of the size of the heap. Certain classes of Restricted Nim are found to produce sequences of Grundy numbers with a self-similar fractal structure. Extending work of C. Kimberling, we obtain new characterizations of these “fractal sequences” and give a bijection between these sequences and certain upper-triangular arrays. As a special case, we obtain the game of Serial Nim, in which the Nim heaps are ordered from left to right, and players can move only in the leftmost nonempty heap.

A graph \(G\) is clique-perfect if the cardinality of a maximum clique-independent set of \(H\) is equal to the cardinality of a minimum clique-transversal of \(H\), for every induced subgraph \(H\) of \(G\). When equality holds for every clique subgraph of \(G\), the graph is \(c\)-clique-perfect. A graph \(G\) is \(K\)-perfect when its clique graph \(K(G)\) is perfect. In this work, relations are described among the classes of perfect, \(K\)-perfect, clique-perfect and \(c\)-clique-perfect graphs. Besides, partial characterizations of \(K\)-perfect graphs using polyhedral theory and clique subgraphs are formulated.

In this note, we investigate arithmetic properties of the Motzkin numbers. We prove that for large \(n\), the product of the first \(n\) Motzkin numbers is divisible by a large prime. The proofs use the Deep Subspace Theorem.

The point-distinguishing chromatic index of a graph \(G\), denoted by \(\chi_o(G)\), is the smallest number of colours in a (not necessarily proper) edge colouring of \(G\) such that any two distinct vertices of \(G\) are distinguished by sets of colours of their adjacent edges. The exact value of \(\chi_o(K_{m,n})\) is found if either \(m \leq 10\) or \(n \geq 8m^2 – 2m + 1\).

Star graphs were introduced by \([1]\) as a competitive model to the \(n\)-cubes. Then hyper-stars were introduced in \([9]\) to be a competitive model to both \(n\)-cubes and star graphs. In this paper, we discuss strong connectivity properties and orientability of the hyper-stars.

In this paper, three methods for constructing larger harmonious graphs from one or a set of harmonious graphs are provided.

The complexity of determining if a Steiner triple system on \(v = 6n + 3\) points contains a parallel class is currently unknown. In this paper, we show that the problem of determining if a partial Steiner triple system on \(v = 6n + 3\) points contains a parallel class is NP-complete. We also consider the problem of determining the chromatic index of a partial Steiner triple system and show that this problem is NP-hard.

In this paper, it has been proved that \(K_{r,r} \times K_{m}\), \(m \geq 3\), is hamiltonian decomposable.