A Note on L（2, 1）-labelling of Trees
An L（2, 1）-labelling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that │f（u） - f（v）│≥2 if dG（u, v） = 1 and │f（u） - f（v）│ ≥ 1 if dG（u, v） = 2. The L（2, 1）-labelling problem is to find the smallest number, denoted by A（G）, such that there exists an L（...
Saved in:
| Published in | 应用数学学报：英文版 Vol. 28; no. 2; pp. 395 - 400 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
2012
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | An L（2, 1）-labelling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that │f（u） - f（v）│≥2 if dG（u, v） = 1 and │f（u） - f（v）│ ≥ 1 if dG（u, v） = 2. The L（2, 1）-labelling problem is to find the smallest number, denoted by A（G）, such that there exists an L（2, 1）-labelling function with no label greater than it. In this paper, we study this problem for trees. Our results improve the result of Wang [The L（2, 1）-labelling of trees, Discrete Appl. Math. 154 （2006） 598-603]. |
|---|---|
| AbstractList | An L（2, 1）-labelling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that │f（u） - f（v）│≥2 if dG（u, v） = 1 and │f（u） - f（v）│ ≥ 1 if dG（u, v） = 2. The L（2, 1）-labelling problem is to find the smallest number, denoted by A（G）, such that there exists an L（2, 1）-labelling function with no label greater than it. In this paper, we study this problem for trees. Our results improve the result of Wang [The L（2, 1）-labelling of trees, Discrete Appl. Math. 154 （2006） 598-603]. |
| Author | Ming-qing ZHAI Chang-hong LU Jin-long SHU |
| AuthorAffiliation | School of Mathematical Science, Nanjing Normal University, Jiangsu, Nanjing 210046, China Department of Mathematics, Chuzhou University, Chuzhou 239012, China Department of Mathematics, East China Normal University, Shanghai 200241, China |
| Author_xml | – sequence: 1 fullname: Ming-qing ZHAI Chang-hong LU Jin-long SHU |
| BookMark | eNrjYmDJy89LZWLgNDQztNA1tjQ2YmHgNDA0s9C1NDM35mDgKi7OMjAwNDc2M-dk0HBU8MsvSVXIz1Pweb-nw0hHwfD9nk7dnMSk1JyczLx0hfw0hZCi1NRiHgbWtMSc4lReKM3NoOjmGuLsoZuckZ-XXghUGl9QlJmbWFQZb2JoZG5saG5uTIwaAPmlMj8 |
| ContentType | Journal Article |
| DBID | 2RA 92L CQIGP ~WA |
| DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库- 镜像站点 |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| DocumentTitleAlternate | A Note on L（2, 1）-labelling of Trees |
| EISSN | 1618-3932 |
| EndPage | 400 |
| ExternalDocumentID | 41273177 |
| GroupedDBID | -52 -5D -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 1SB 2.D 23M 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2RA 2VQ 2~H 30V 4.4 406 408 40D 40E 5GY 5QI 5VR 5VS 6NX 8TC 8UJ 92L 95- 95. 95~ 96X AAAVM AABHQ AABYN AAFGU AAHNG AAIAL AAJKR AANZL AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABBBX ABDZT ABECU ABFGW ABFTV ABHLI ABHQN ABJOX ABKAS ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBMV ACBRV ACBXY ACBYP ACGFS ACHSB ACHXU ACIGE ACIPQ ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACSNA ACTTH ACVWB ACWMK ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEEQQ AEFIE AEFTE AEGAL AEGNC AEJHL AEJRE AEKMD AEOHA AEPOP AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AFEXP AFGCZ AFLOW AFMKY AFNRJ AFQWF AFUIB AFWTZ AFZKB AGAYW AGDGC AGGBP AGGDS AGJBK AGMZJ AGPAZ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AKQUC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD B-. BA0 BAPOH BBWZM BDATZ BGNMA CAG CCEZO CCVFK CHBEP COF CQIGP CS3 CSCUP CW9 DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG F5P FA0 FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 HF~ HG6 HMJXF HRMNR HVGLF HZ~ IHE IJ- IKXTQ IWAJR IXD I~X I~Z J-C JBSCW JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J P19 P2P P9R PF0 PT4 PT5 QOK QOS R4E R89 R9I REI RHV RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCL SCLPG SDD SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR ZMTXR ZWQNP ~A9 ~EX ~WA |
| ID | FETCH-chongqing_primary_412731773 |
| ISSN | 0168-9673 |
| IngestDate | Wed Feb 14 10:47:22 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-chongqing_primary_412731773 |
| Notes | An L（2, 1）-labelling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that │f（u） - f（v）│≥2 if dG（u, v） = 1 and │f（u） - f（v）│ ≥ 1 if dG（u, v） = 2. The L（2, 1）-labelling problem is to find the smallest number, denoted by A（G）, such that there exists an L（2, 1）-labelling function with no label greater than it. In this paper, we study this problem for trees. Our results improve the result of Wang [The L（2, 1）-labelling of trees, Discrete Appl. Math. 154 （2006） 598-603]. distance-two labelling; L（2, 1）-labelling; tree 11-2041/O1 |
| ParticipantIDs | chongqing_primary_41273177 |
| PublicationCentury | 2000 |
| PublicationDate | 2012 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – year: 2012 text: 2012 |
| PublicationDecade | 2010 |
| PublicationTitle | 应用数学学报：英文版 |
| PublicationTitleAlternate | Acta Mathematicae Applicatae Sinica |
| PublicationYear | 2012 |
| SSID | ssj0017367 |
| Score | 3.7809534 |
| Snippet | An L（2, 1）-labelling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that │f（u） - f（v）│≥2 if dG（u, v） = 1 and... |
| SourceID | chongqing |
| SourceType | Publisher |
| StartPage | 395 |
| SubjectTerms | 函数 数学 标签 树木 非负整数集 顶点集 |
| Title | A Note on L（2, 1）-labelling of Trees |
| URI | http://lib.cqvip.com/qk/85829X/201202/41273177.html |
| Volume | 28 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA7iSQ_iE99UMCCskaaPNDlmtbLKrhd3QbxI201RkK6u68VfoP_J_-RfcGZTuxVU1EtIEzp5fGX6McnMELJrvDCTaZ4wDtyBBQlXoAf7kgUmD9NEiSRN0DTQOROtXnB6EV5Msq6NvUtG6UH29KVfyX9QhTbAFb1k_4BsJRQaoA74QgkIQ_krjHXjbIDH_EWjTeNj2jykwGRx0_jHo2KAsrFxt4EWdoemvDNY8lEah7SpqQpoHGGpJY0FVdDoYpc-olrUKoJKTXVYSleaxpLKJm3y8VvQG6Ecqaisbsh2YGh2j-NftvSJ9WZg15jhqN1rnN4U7Bbr561e3f7APxkjBShLYVORHBirQAWXzFf-Jw3rydqX5NXUpW8TbJZ_3sB1J3-l6q5gwIFh8QgDBmAkIFBZPU9XB0WRL6xHfDkVDJGBa8B11YhCd57MlQzf0RauBTJlikUy26nC4z4skT3tIHDOoHDab6_P3r7D315fJlA5g9wZQ7VMdo7j7mGLVaNd3dnwIFcfE_ZXyHQxKMwqcWRfuX0VelGaRYHnZokr3DTJPV9kLje5WCPr38tZ_6lzg8wgKNYotEmmR8NHswU0aZRujzfqHendCxs |
| link.rule.ids | 315,786,790,4043 |
| linkProvider | Springer Nature |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Note+on+L%EF%BC%882%2C+1%EF%BC%89-labelling+of+Trees&rft.jtitle=%E5%BA%94%E7%94%A8%E6%95%B0%E5%AD%A6%E5%AD%A6%E6%8A%A5%EF%BC%9A%E8%8B%B1%E6%96%87%E7%89%88&rft.au=Ming-qing+ZHAI+Chang-hong+LU+Jin-long+SHU&rft.date=2012&rft.issn=0168-9673&rft.eissn=1618-3932&rft.volume=28&rft.issue=2&rft.spage=395&rft.epage=400&rft.externalDocID=41273177 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F85829X%2F85829X.jpg |