Abstract
The partition dimension of the graphs is one of the open problems in graph theory. One of the methods which are used researcher is a graph operation, for example, subdivision operations. Let G be a connected graph of order n. The subdivision operation of G is an operation in G that replaces any edge by a path Pki+2 for ki ≥ 1 and i ∈ [1, n]. The result graph of this operation is called the subdivision graph, is denoted by S(G(E; k1, k2, ⋯, kn)). Furthermore, if each ki = 1, then the subdivision graph is denoted by S(G). One of the most recent results on the partition dimension of subdivision operation in the general graphs is published by Amrullah, et al 2016. However, the results show only an upper and lower bounds of the subdivision graph partition dimension. Therefore, this paper is devoted to finding the partition dimension of subdivision graph S(G) and S(G(E; k1, k2, ⋯, kn)) on special star graphs G = K1,n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
