Neighbor sum distinguishable k-edge colorings of the join with two graphs

Huan Yang; Shuangliang Tian

doi:10.1117/12.2627479

22 April 2022 Neighbor sum distinguishable k-edge colorings of the join with two graphs

Huan Yang, Shuangliang Tian

Proceedings Volume 12163, International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021); 121634I (2022) https://doi.org/10.1117/12.2627479
Event: International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021), 2021, Nanjing, China

Abstract

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 .

Citation Download Citation

Huan Yang and Shuangliang Tian "Neighbor sum distinguishable k-edge colorings of the join with two graphs", Proc. SPIE 12163, International Conference on Statistics, Applied Mathematics, and Computing Science (CSAMCS 2021), 121634I (22 April 2022); https://doi.org/10.1117/12.2627479

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available