Journals / Turkish Journal of Mathematics and Computer Science / 2019 / Cilt: 11 - Sayı: 1

Strong Roman Domination Number of Complementary Prism Graphs

Pages
40–47
DOI
—

Abstract

Let $G=(V,E)$ be a simple graph with vertex set $V=V(G)$, edge set $E=E(G)$ and from maximum degree $\Delta=\Delta(G)$. Also let

Strong Roman Domination Number of Complementary Prism Graphs — AJIndex