ABSTRACT. 

Let \( n \ge 3 \) be an integer with primitive root \( \varpi \). For a simple connected graph \( G \) of order \( n \), a bijective function \( f : V(G) \to \{1,2,\ldots,n\} \) is called a logarithmic cordial labeling to the base \( \varpi \) modulo \( n \) if the induced function \( f_{\varpi,n}^{*} : E(G) \to \{0,1\} \) is defined by

\[
f_{\varpi,n}^{*}(ab)=
\begin{cases}
0, \text{ if } \mathrm{ind}_{\varpi,n}(f(a)+f(b)) \equiv 0 \pmod 2 \text{ or } \gcd(f(a)+f(b),n)\neq 1, \\
1, \text{ if } \mathrm{ind}_{\varpi,n}(f(a)+f(b)) \equiv 1 \pmod 2,
\end{cases}
\]

and satisfies the condition \( |e_{f_{\varpi,n}}(0) – e_{f_{\varpi,n}}(1)| \le 1 \), where \( e_{f_{\varpi,n}}(i) \) is the number of edges with label \( i \ (i=0,1) \).