Channel assignment problem and n-fold t-separated $$L(j_1,j_2,\ldots ,j_m)$$ L ( j 1 , j 2 , … , j m ) -labeling of graphs
Crossref DOI link: https://doi.org/10.1007/s10878-018-0255-0
Published Online: 2018-02-20
Published Print: 2018-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lin, Wensong
Shen, Chenli
Text and Data Mining valid from 2018-02-20
Article History
First Online: 20 February 2018