Making use of \(q\)-derivative operator, in this paper, we introduce new subclasses of the function class & of normalized analytic and bi-starlike functions defined in the open disk \(\mathbb{U}\). Furthermore, we find estimates on the first two Taylor-Maclaurin coefficients \(|a_2|\) and \(|a_3|\). Moreover, we obtain Fekete-Szegö inequalities for the new function classes.

A set \(S\) of vertices in a graph \(G\) is called a dominating set of \(G\) if every vertex in \(V(G)\S\) is adjacent to some vertex in \(S\). A set S is said to be a power dominating set of \(G\) if every vertex in the system is monitored by the set \(S\) following a set of rules for power system monitoring. A zero forcing set of \(G\) is a subset of vertices B such that if the vertices in \(B\) are colored blue and the remaining vertices are colored white initially, repeated application of the color change rule can color all vertices of \(G\) blue. The power domination number and the zero forcing number of G are the minimum cardinality of a power dominating set and the minimum cardinality of a zero forcing set respectively of \(G\). In this paper, we obtain the power domination number, total power domination number, zero forcing number and total forcing number for m-rooted sibling trees, l-sibling trees and I-binary trees. We also solve power domination number for circular ladder, Möbius ladder, and extended cycle-of-ladder.

A proper vertex coloring of a graph where every node of the graph dominates all nodes of some color class is called the dominator coloring of the graph. The least number of colors used in the dominator coloring of a graph is called the dominator coloring number denoted by \(X_d(G)\). The dominator coloring number and domination number of central, middle, total and line graph of quadrilateral snake graph are derived and the relation between them are expressed in this paper.

A digraph G is finite and is denoted as \(G(V,E)\) with \(V\) as set of nodes and E as set of directed arcs which is exact. If \((u, v)\) is an arc in a digraph \(D\), we say vertex u dominates vertex v. A special digraph arises in round robin tournaments. Tournaments with a special quality \(Q(n, k)\) have been studied by Ananchuen and Caccetta. Graham and Spencer defined tournament with \(q\) vertices
where \(q \equiv 3 (mod 4)\) is a prime. It was named suitably as Paley digraphs in respect deceased Raymond Paley, he was the person used quadratic residues to construct Hadamard matrices more than 50 years earlier. This article is based on a special class of graph called Paley digraph which admits odd edge graceful, super edge graceful and strong edge graceful labeling.

Molecular graphs are models of molecules in which atoms are represented by vertices and chemical bonds by edges of a graph. Graph invariant numbers reflecting certain structural features of a molecule that are derived from its molecular graph are known as topological indices. A topological index is a numerical descriptor of a molecule, based on a certain topological feature of the corresponding molecular graph. One of the most widely known topological descriptor is the Wiener index. The Weiner index \(w(G)\) of a graph G is defined as the half of the sum of the distances between every pair of vertices of \(G\). The construction and investigation of topological is one of the important directions in mathematical chemistry. The common neighborhood graph of G is denoted by con(\(G\)) has the same vertex set as G, and two vertices of con(\(G\)) are adjacent if they have a common neighbor in \(G\). In this paper we investigate the Wiener index of \(Y-tree,\, X-tree,\, con(Y-tree)\) and \(con(X-tree)\).

In the field of membrane computing. P system is a versatile model of computing, introduced by Paun [6], based on a combination of (i) the biological features of functioning of living cells and the members structure and (ii) the theoretical  concepts and results related to formal language theory. Among different Application areas of the model of P system, Ceterchi et al. [2] proposed an array-rewriting P system generating picture arrays based on the well-established notions in the area of array rewriting grammars and iso-array grammar have also been introduced. In this paper we consider structures in the two-dimensional plane called equi-triangular array composed of equilateral triangular array grammar and a corresponding P system, in the order to generate such structures. We Also examine the generative power of these new models of picture generation.

We disprove a conjecture proposed in [Gaspers et al., Discrete Applied Mathematics, 2010] and provide a new upper bound for the minimum number of brushes required to continually parallel clean a clique.

The strong chromatic index \( \chi’_s(G) \) of a graph \( G \) is the smallest integer \( k \) such that \( G \) has a proper edge \( k \)-coloring with the condition that any two edges at distance at most 2 receive distinct colors. It is known that \( \chi’_s(G) \leq 3\Delta – 2 \) for any \( K_4 \)-minor free graph \( G \) with \( \Delta \geq 3 \). We give a polynomial algorithm in order \( O(|E(G)|(n\Delta^2 + 2n + 14\Delta)) \) to strong color the edges of a \( K_4 \)-minor free graph with \( 3\Delta – 2 \) colors where \( \Delta \geq 3 \).

We introduce a new representation of MOFS of type \( F(m\lambda; \lambda) \), as a linear combination of \( \{0,1\} \) arrays. We use this representation to give an elementary proof of the classical upper bound, together with a structural constraint on a set of MOFS achieving the upper bound. We then use this representation to establish a maximality criterion for a set of MOFS of type \( F(m\lambda; \lambda) \) when \( m \) is even and \( \lambda \) is odd, which simplifies and extends a previous analysis \cite{ref3} of the case when \( m = 2 \) and \( \lambda \) is odd.

Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for the arboricity we want to partition the vertices into cycle-free subsets (i.e., forests). Arboricity is NP-hard in general, and our focus is on the arboricity of cographs. For arboricity two, we obtain the complete list of minimal cograph obstructions. These minimal obstructions do generalize to higher arboricities; however, we no longer have a complete list, and in fact, the number of minimal cograph obstructions grows exponentially with arboricity.

We obtain bounds on their size and the height of their cotrees. More generally, we consider the following common generalization of colouring and partition into forests: given non-negative integers \( p \) and \( q \), we ask if a given cograph \( G \) admits a vertex partition into \( p \) forests and \( q \) independent sets. We give a polynomial-time dynamic programming algorithm for this problem. In fact, the algorithm solves a more general problem which also includes several other problems such as finding a maximum \( q \)-colourable subgraph, maximum subgraph of arboricity-\( p \), minimum feedback vertex set and the minimum weight of a \( q \)-colourable feedback vertex set.