Abstract
A simple graph $G=(V,E)$ admits an $H$-covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $H$. $G$ is $H$-magic if there is a total labeling $f:V\cup E\rightarrow\{1,2,3,\cdots,|V|+|E|\}$ such that for each subgraph $H'=(V',E')$ of $G$ isomorphic to $H$, $ \underset{v \in V_1}\sum f(v)+\underset{e \in E_1}\sum f(e)=s$ is constant. When $f(V)=\{1,2, \cdots,|V|\}$, then $G$ is said to be $H$-supermagic. In this paper, we show that $P_{m,n}$ and the splitting graph of a cycle $C_{n}$ are cycle-supermagic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Mathematics and Soft Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.