We prove that the corona graphs \(C_n \circ K_1\) are \(k\)-equitable, as per Cahit’s definition of \(k\)-equitability, for \(k = 2, 3, 4, 5, 6\).

For a vertex \(v\) of a graph \(G = (V, E)\), the domination number \(\gamma(G)\) of \(G\) relative to \(v\) is the minimum cardinality of a dominating set in \(G\) that contains \(v\). The average domination number of \(G\) is \(\gamma_{av}(G) = \frac{1}{|V|} \sum_{v\in V} \gamma_v(G)\). The independent domination number \(i_v(G)\) of \(G\) relative to \(v\) is the minimum cardinality of a maximal independent set in \(G\) that contains \(v\). The average independent domination number of \(G\) is \(\gamma_{av}^i(G) = \frac{1}{|V|} \sum_{v\in V} i_v(G)\). In this paper, we show that a tree \(T\) satisfies \(\gamma_{av}(T) = i_{av}(T)\) if and only if \(A(T) = \vartheta\) or each vertex of \(A(T)\) has degree \(2\) in \(T\), where \(A(T)\) is the set of vertices of \(T\) that are contained in all its minimum dominating sets.

A graph \(G\) is \(K_r\)-covered if each vertex of \(G\) is contained in a clique \(K_r\). Let \(\gamma(G)\) and \(\gamma_t(G)\) respectively denote the domination and the total domination number of \(G\). We prove the following results for any graph \(G\) of order \(n\):

If \(G\) is \(K_6\)-covered, then \(\gamma_t(G) \leq \frac{n}{3}\),

If \(G\) is \(K_r\)-covered with \(r = 3\) or \(4\) and has no component isomorphic to \(K_r\), then \(\gamma_t(G) \leq \frac{2n}{r+1}\),

If \(G\) is \(K_3\)-covered and has no component isomorphic to \(K_3\), then \(\gamma(G) + \gamma_t(G) \leq \frac{7n}{9}\).

Corollaries of the last two results are that every claw-free graph of order \(n\) and minimum degree at least \(3\) satisfies \(\gamma_t(G) \leq \frac{n}{2}\) and \(\gamma(G) + \gamma(G) \leq \frac{7n}{9}\). For general values of \(r\), we give conjectures which would generalise the previous results. They are inspired by conjectures of Henning and Swart related to less classical parameters \(\gamma_{K_r}\) and \(\gamma^t_{K_r}\).

We are interested in linear-fractional transformations \(y,t\) satisfying the relations \(y^6=t^6 = 1\), with a view to studying an action of the subgroup \(H = \) on \({Q}(\sqrt{n}) \cup \{\infty\}\) by using coset diagrams.

For a fixed non-square positive integer \(n\), if an element \(\alpha = \frac{a+\sqrt {n}}{c}\) and its algebraic conjugate have different signs, then \(\alpha\) is called an ambiguous number. They play an important role in the study of action of the group \(H\) on \({Q}(\sqrt{n}) \cup \{\infty\}\). In the action of \(H\) on \({Q}(\sqrt{n}) \cup \{\infty\}\), \(\mathrm{Stab}_\alpha{(H)}\) are the only non-trivial stabilizers and in the orbit \(\alpha H\); there is only one (up to isomorphism). We classify all the ambiguous numbers in the orbit and use this information to see whether the action is transitive or not.

We are studying clique graphs of planar graphs, \(K(\text{Planar})\), this means the graphs which are the intersection of the clique family of some planar graph. In this paper, we characterize the \(K_3\) – free and \(K_4\) – free graphs which are in \(K(\text{Planar})\).

We show that a self-complementary vertex-transitive graph of order \(pq\), where \(p\) and \(q\) are distinct primes, is isomorphic to a circulant graph of order \(pq\). We will also show that if \(\Gamma\) is a self-complementary Cayley graph of the nonabelian group \(G\) of order \(pq\), then \(\Gamma\) and the complement of \(\Gamma\) are not isomorphic by a group automorphism of \(G\).

One of the most important problems of coding theory is to construct codes with the best possible minimum distance. The class of quasi-cyclic codes has proved to be a good source for such codes. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound introduced in [17] to search for quasi-cyclic codes which improve the minimum distances of the best-known linear codes. We construct \(11\) new linear codes over \(\text{GF}(8)\) where \(3\) of these codes are one unit away from being optimal.

A graph \(G\) is said to be \(locally\) \(hamiltonian\) if the subgraph induced by the neighbourhood of every vertex is hamiltonian. Alabdullatif conjectured that every connected locally hamiltonian graph contains a spanning plane triangulation. We disprove the conjecture. At the end, we raise a problem about the nonexistence of spanning planar triangulation in a class of graphs.

Recently, Babson and Steingrimsson (see \([BS]\)) introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation.

In this paper we study the generating functions for the number of permutations on \(n\) letters avoiding a generalized pattern \(ab-c\) where \((a,b,c) \in S_3\), and containing a prescribed number of occurrences of a generalized pattern \(cd-e\) where \((c,d,e) \in S_3\). As a consequence, we derive all the previously known results for this kind of problem, as well as many new results.

Let \(G = (V,E)\) be a simple graph. For any real valued function \(f:V \to {R}\) and \(S \subset V\), let \(f(S) = \sum_{v\in S} f(u)\). A signed \(k\)-subdominating function is a function \(f: V \to \{-1,1\}\) such that \(f(N[v]) \geq 1\) for at least \(k\) vertices \(v \in V\). The signed \(k\)-subdomination number of a graph \(G\) is \(\gamma_{ks}^{-11}(G) = \min \{f(V) | f \text{ is a signed } k\text{-subdominating function on } G\}\). In this paper, we obtain lower bounds on this parameter and extend some results in other papers.