In this paper, we inquire into the neighbor sum distinguishable edge coloring of join graph, and it’s neighbor sum distinguishable chromatic number was considered. Let G be a complete graphs with order n, and H is a path or circle, we obtains exact value of the neighbor sum distinguishable chromatic number with respect to the join of graphs G and H, its value is 2n .
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.