Annals of Communications in Mathematics

ABSTRACT.An injective function \( f : V(G) \to \{T_0, T_1, T_2, \ldots, T_n\} \), where \( n = |V(G)| - 1 \), is said to be a Tribonacci cordial labeling if the induced function \( f^{*} : E(G) \to \{0,1\} \) defined by \( f^{*}(uv) = (f(u) + f(v)) \pmod 2 \) satisfies the condition \( |e_f(0) - e_f(1)| \le 1 \), where \( e_f(0) \) is the number of edges with label \( 0 \) and \( e_f(1) \) is the number of edges with label \( 1 \). A graph that admits such labeling is called a Tribonacci cordial graph. In this paper, we determine the Tribonacci cordial labeling of Triangular Snake Graph \( TS_n \), Double Triangular Snake Graph \( DT(S_n) \), Quadrilateral Snake Graph \( QS_n \), Double Quadrilateral Snake Graph \( D(QS_n) \), and Cycle Quadrilateral Snake Graph \( C(QS_n) \).

ABSTRACT. A dominating set \( S \) in \( G \) is called a pendant dominating set if \( \langle S \rangle \) contains at least one pendant vertex. The minimum cardinality of a pendant dominating set is called the pendant domination number, denoted by \( \gamma_{pe}(G) \). The pendant domination polynomial of \( G \) is denoted by \( D_{pe}(G,x) \) and is defined as\[D_{pe}(G,x)=\sum_{i=\gamma_{pe}(G)}^{n} d_{pe}(G,i)\,x^{i},\]where \( d_{pe}(G,i)x^{i} \) is the number of pendant dominating sets of size \( i \). In this paper, we obtained the pendant domination number and pendant domination polynomial of the corona of some graphs, namely, \( P_m \circ K_n \), \( C_m \circ K_n \), and \( K_m \circ K_n \).

ABSTRACT. An injective function \( f : V(G) \to \{L_1, L_2, \ldots, L_n\} \), where \( L_j \) is the \( j^{\text{th}} \) Lucas number \( (j=1,2,\ldots,n) \), is said to be a Lucas cordial labeling if the induced function \( f^{*} : E(G) \to \{0,1\} \) defined by \( f^{*}(uv) = (f(u)+f(v)) \pmod 2 \) satisfies \( |e_f(0)-e_f(1)| \le 1 \). A graph admitting such labeling is called a Lucas cordial graph.