Let \(\gamma_c(G)\) be the connected domination number of \(G\).A graph is \(k\)-\(\gamma_c\)-critical if \(\gamma_c(G) = k\) and \(\gamma_c(G + uv) < \gamma_c(G)\) for any nonadjacent pair of vertices \(u\) and \(v\) in the graph \(G\). In this paper, we show that the diameter of a \(k\)-\(\gamma_c\)-critical graph is at most \(k\) and this upper bound is sharp.

A \(b\)-coloring of a graph \(G\) by \(k\) colors is a proper \(k\)-coloring of the vertices of \(G\) such that in each color class there exists a vertex having neighbors in all the other \(k-1\) color classes. The \(b\)-chromatic number \(\varphi(G)\) of a graph \(G\) is the maximum \(k\) for which \(G\) has a \(b\)-coloring by \(k\) colors. This concept was introduced by R.W. Irving and D.F. Manlove in \(1999\). In this paper, we study the \(b\)-chromatic numbers of the cartesian products of paths and cycles with complete graphs and the cartesian product of two complete graphs.

Let \(K_{d,d}\) be a complete bipartite digraph. In this paper, we determine the exact value of the domination number in iterated line digraph of \(K_{d,d}\).

A total coloring of a simple graph \(G\) is called adjacent vertex distinguishing if for any two adjacent and distinct vertices \(u\) and \(v\) in \(G\), the set of colors assigned to the vertices and the edges incident to \(u\) differs from the set of colors assigned to the vertices and the edges incident to \(v\). In this paper, we shall prove that the adjacent vertex distinguishing total chromatic number of an outer plane graph with \(\Delta \leq 5\) is \(\Delta+2\) if \(G\) has two adjacent maximum degree vertices, otherwise it is \(\Delta+1\).

Let \(P_j(n)\) denote the number of representations of \(n\) as a sum of \(j\) pentagonal numbers. We obtain formulas for \(P_j(n)\) when \(j = 2\) and \(j = 3\).

Eternal domination of a graph requires the vertices of the graph to be protected, against infinitely long sequences of attacks, by guards located at vertices, with the requirement that the configuration of guards induces a dominating set at all times. We study some variations of this concept in which the configuration of guards induce total dominating sets. We consider two models of the problem: one in which only one guard moves at a time and one in which all guards may move simultaneously. A number of upper and lower bounds are given for the number of guards required.

Let \(G\) be a finite graph and \(H\) be a subgraph of \(G\). If \(V(H) = V(G)\) then the subgraph is called a spanning subgraph of \(G\). A spanning subgraph \(H\) of \(G\) is called an \(F\)-factor if each component of \(H\) is isomorphic to \(F\). Further, if there exists a subgraph of \(G\) whose vertex set is \(V(G)\) and can be partitioned into \(F\)-factors, then it is called a \(\lambda\)-fold \(F\)-factor of \(G\), denoted by \(S_\lambda(1,F,G)\). A large set of \(\lambda\)-fold \(F\)-factors of \(G\), denoted by \(LS_\lambda(1,F,G)\), is a partition \(\{\mathcal{B}_i\}_i\) of all subgraphs of \(G\) isomorphic to \(F\), such that each \((X,\mathcal{B}_i)\) forms a \(\lambda\)-fold \(F\)-factor of \(G\). In this paper, we investigate \(LS_\lambda(1,K_{1,3},K_{v,v})\) for any index \(\lambda\) and obtain existence results for the cases \(v = 4t, 2t + 1, 12t+6\) and \(v \geq 3\).

In this paper, we give some interesting identities on the Bernoulli and the Euler numbers and polynomials by using reflection symmetric properties of Euler and Bernoulli polynomials. To derive our identities, we investigate some properties of the fermionic \(p\)-adic integrals on \(\mathbb{Z}_p\).

For any abelian group \(A\), we denote \(A^*=A-\{0\}\). Any mapping \(1: E(G) \to A^*\) is called a labeling. Given a labeling on the edge set of \(G\) we can induce a vertex set labeling \(1^+: V(G) \to A\) as follows:

\[1^+(v) = \Sigma\{1(u,v): (u,v) \in E(G)\}.\]

A graph \(G\) is known as \(A\)-magic if there is a labeling \(1: E(G) \to A^*\) such that for each vertex \(v\), the sum of the labels of the edges incident to \(v\) are all equal to the same constant; i.e., \(1^+(v) = c\) for some fixed \(c\) in \(A\). We will call \(\langle G,\lambda \rangle\) an \(A\)-magic graph with sum \(c\).

We call a graph \(G\) fully magic if it is \(A\)-magic for all non-trivial abelian groups \(A\). Low and Lee showed in [11] if \(G\) is an eulerian graph of even size, then \(G\) is fully magic. We consider several constructions that produce infinite families of fully magic graphs. We show here every graph is an induced subgraph of a fully magic graph.