Author

N. Eswar

h-index 0 View on Semantic Scholar

We have 1 of 1 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access 2026

On the k-Total Domination Number of Circulant, Shadow, and Strong Product Graphs

A set <inline-formula> <tex-math notation="LaTeX">$S\subseteq V(G)$ </tex-math></inline-formula> is called a <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-total dominating set of a graph <inline-formula> <tex-math notation="LaTeX">$G$ </tex-math></inline-formula> if every vertex of <inlin...

N. Eswar, R. Jayagopal · IEEE Access · 0 citations