Star related subset cordial graphs

A subset cordial labeling of a graph G with vertex set $V$ is an injection $f$ from $V$ to the power set of${1, 2,dots ,n}$ such that an edge $uv$ is assigned the label $1$ if either $f(u)$ is a subset of $f(v)$ or $f(v)$ is a subset of $f(u)$ and $0$ otherwise. Then the number of edges labeled 0 and 1 differ by at most 1. If a graph has a subset cordial labeling then it is called a subset cordial graph. In this paper, we prove that some star related graphs such as splitting graph of star, identification of star with a graph are subset cordial.