A questionnaire is a sequence of multiple choice questions aiming to collect data on a population. We define an abstract questionnaire as an ordered pair \((N,\mathcal{M})\), where \(N\) is a positive integer and \(\mathcal{M}=(m_0,m_1,\ldots,m_{N-1})\) is an \(N\)-tuple of positive integers, with \(m_i\), for \(i \in \mathbb{Z}_N\), as the number of possible answers to question \(i\). An abstract questionnaire may be endowed with a skip-list (which tells us which questions to skip based on the sequence of answers to the earlier questions) and a flag-set (which tells us which sequences of answers are of special interest). An FS-decision tree is a decision tree of an abstract questionnaire that also incorporates the information contained in the skip-list and flag-set. The main objective of this paper is to represent the abstract questionnaire using a directed graph, which we call an FS-decision digraph, that contains the full information of an FS-decision tree, but is in general much more concise. We present an algorithm for constructing a fully reduced FS-decision digraph, and develop the theory that supports it. In addition, we show how to generate all possible orderings of the questions in an abstract questionnaire that respect a given precedence relation.

A hypergraph \(H\) is said to be \(r\)-partite \(r\)-uniform if its vertex set \(V\) can be partitioned into non-empty sets \(V_1, V_2, \cdots, V_r\) so that every edge in the edge set \(E(H)\), consists of precisely one vertex from each set \(V_i\), \(i=1,2,\cdots,r\). It is denoted as \(H^r(V_1,V_2,\cdots,V_r)\) or \(H^r_{(n_1,n_2,\cdots,n_r)}\) if \(|V_i|=n_i\) for \(i=1,2,\cdots,r\). There exists an \(r\)-partite self-complementary \(r\)-uniform hypergraph \(H^r(V_1,V_2,\cdots,V_r)\) where \(|V_i|=n_i\) for \(i=1,2,\cdots,r\) if and only if at least one of \(n_1,n_2,\cdots,n_r\) is even. And there exists an \(r\)-partite almost self-complementary \(r\)-uniform hypergraph \(H^r(V_1, V_2,\cdots,V_r)\) where \(|V_i|=n_i\) for \(i=1,2,\cdots,r\) if and only if \(n_1,n_2,\cdots,n_r\) are odd. In this paper, we prove the existence of regular \(3\)-partite self-complementary \(3\)-uniform hypergraphs. Further we prove there does not exist a regular \(3\)-partite almost self-complementary \(3\)-uniform hypergraph.

We study the difference between the numbers of even and odd permutations in \(\mathfrak{S}_n\) having exactly \(k\) fixed points. We derive a closed formula for this quantity using four complementary approaches: exponential generating functions, a determinant representation, a combinatorial derivation based on inclusion–exclusion on cycle structures, and a factorization via the stabilizer subgroup, through restriction to the complement of the fixed-point set. The resulting expression provides a signed refinement of the classical rencontres numbers and yields a simple polynomial form for the associated signed fixed-point distribution.

Let \(L(G(k))\) be a line graph of a \(k\)-subdivided graph \(G(k)\) of any connected, simple and undirected graph \(G\). In this paper, we fixed the valency dependence invariants of \(L(G(k))\) for \(k\geq2.\) Our results are the generalization of the results proved in [1,3,8].

The present paper gives a detailed study of the structural theory of triple \(\theta\)-skew cyclic codes where the codes are over \(\mathbb{F}_q\). We give a complete characterization of these codes, focusing on their representation as modules. We identify the generator polynomials for the triple skew-cyclic codes as well as those of their duals. We explore the properties of these generator polynomials and their relationship to the code’s structure. Additionally,To illustrate our approach, we give concrete instances of triple \(\theta\)-skew cyclic codes to demonstrate how these structures can behave in practice. The special instances we present reveal that such codes are capable of achieving strong parameters under certain conditions.

Let \(P_{k+1}\) denote a path of length \(k\), let \(S_{m}\) denote a star with \(m\) edges, and let \(K_{n}(\lambda)\) denote the complete multigraph on \(n\) vertices in which every edge is taken \(\lambda\) times. In this paper, we prove that the necessary conditions are also sufficient for a \(\{P_{4}, S_{4}\}\)-decomposition of \(K_{n}(\lambda)\).

In \(1973\), Harary and Palmer posed the problem of enumeration of labeled graphs on \(n \geq 1\) unisolated vertices and \(l \geq 0\) edges. In \(1997\), Bender et al. obtained a recurrence relation representing the sequence \(A054548\)(OEIS) of labeled graphs on \(n \geq 0\) unisolated vertices containing \(q \geq \frac{n}{2}\) edges. In \(2020\), Bhavale and Waphare obtained a recurrence relation representing the sequence of fundamental basic blocks on \(n \geq 0\) comparable reducible elements, having nullity \(l \geq \lfloor \frac{n+1}{2} \rfloor\). In this paper, we prove the equivalence of these two sequences. We also provide an edge labeling for a given vertex labeled finite simple graph.

Let \(G\) be a graph with vertex set \(V\) and edge set \(E\) such that every edge \(e\in E\) belongs to at least one copy of a given subgraph \(H\) of \(G\). A bijection \(f:V\cup E\to \{1,2,\dots,|V|+|E|\}\) is called an \(H\)-supermagic labeling if the sum of labels of all vertices and edges of every copy of \(H\) is equal to the same number \(\mu\) and the vertices are labeled with the first \(|V|\) integers. A \(p\)-calendula graph \(Cal_{m,p[n]}\) consists of a cycle \(C_m\) with \(p\) copies of \(C_n\) amalgamated to each edge of \(C_m\). We generalize a previous result by Pradipta and Salman on 1-calendula graphs by providing \(C_n\)-supermagic labelings of \(Cal_{m,p[n]}\) for all \(m,n\geq3, p\geq 1\), and \(m\neq n\). The case of \(m=n, \ p>1\) remains open.