Radio number of trees
A radio labeling of a graph G is a mapping f:V(G)→{0,1,2,…} such that |f(u)−f(v)|≥diam(G)+1−d(u,v) for every pair of distinct vertices u,v of G, where diam(G) is the diameter of G and d(u,v) the distance between u and v in G. The radio number of G is the smallest integer k such that G has a radio la...
Saved in:
| Published in | Discrete Applied Mathematics Vol. 217; pp. 110 - 122 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
30.01.2017
Elsevier BV |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0166-218X 1571-0653 1872-6771 1571-0653 |
| DOI | 10.1016/j.dam.2016.09.019 |
Cover
| Abstract | A radio labeling of a graph G is a mapping f:V(G)→{0,1,2,…} such that |f(u)−f(v)|≥diam(G)+1−d(u,v) for every pair of distinct vertices u,v of G, where diam(G) is the diameter of G and d(u,v) the distance between u and v in G. The radio number of G is the smallest integer k such that G has a radio labeling f with max{f(v):v∈V(G)}=k. We give a necessary and sufficient condition for a lower bound on the radio number of trees to be achieved, two other sufficient conditions for the same bound to be achieved by a tree, and an upper bound on the radio number of trees. Using these, we determine the radio number for three families of trees. |
|---|---|
| AbstractList | A radio labeling of a graph G is a mapping f : V(G) → {0, 1, 2, ...} such that | f(u) - f(v)| ≥ diam(G) + 1 - d(u,v) for every pair of distinct vertices u,v of G, where diam(G) is the diameter of G and d(u,v) the distance between u and v in G. The radio number of G is the smallest integer k such that G has a radio labeling f with max{ f(v) : v ∈ V(G)} = k. We give a necessary and sufficient condition for a lower bound on the radio number of trees to be achieved, two other sufficient conditions for the same bound to be achieved by a tree, and an upper bound on the radio number of trees. Using these, we determine the radio number for three families of trees. A radio labeling of a graph G is a mapping f:V(G)→{0,1,2,…} such that |f(u)−f(v)|≥diam(G)+1−d(u,v) for every pair of distinct vertices u,v of G, where diam(G) is the diameter of G and d(u,v) the distance between u and v in G. The radio number of G is the smallest integer k such that G has a radio labeling f with max{f(v):v∈V(G)}=k. We give a necessary and sufficient condition for a lower bound on the radio number of trees to be achieved, two other sufficient conditions for the same bound to be achieved by a tree, and an upper bound on the radio number of trees. Using these, we determine the radio number for three families of trees. |
| Author | Bantva, Devsi Vaidya, Samir Zhou, Sanming |
| Author_xml | – sequence: 1 givenname: Devsi surname: Bantva fullname: Bantva, Devsi email: devsi.bantva@gmail.com organization: Department of Mathematics, Lukhdhirji Engineering College, Morvi 363 642, Gujarat, India – sequence: 2 givenname: Samir surname: Vaidya fullname: Vaidya, Samir email: samirkvaidya@yahoo.co.in organization: Department of Mathematics, Saurashtra University, Rajkot 360 005, Gujarat, India – sequence: 3 givenname: Sanming orcidid: 0000-0001-9854-6076 surname: Zhou fullname: Zhou, Sanming email: smzhou@ms.unimelb.edu.au organization: School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia |
| BookMark | eNqNkM1LAzEQxYNUsK0ePXgreN41ye7mA09S_IKCIAreQpJNIMt2U5Os0v_elPXkoXiaGd78HvNmAWaDHwwAVwiWCCJy05Wt3JY4tyXkJUT8BMwRo7gglKIZmGeBFBixjzOwiLGDEKI8zcHlq2ydXw3jVpmw8naVgjHxHJxa2Udz8VuX4P3h_m39VGxeHp_Xd5tCV4SlgjWIW07qmmGCrdVKSdtCgqlRijaMK0UYpJzWDLXW2EZBbnTToFpjWkFEqyXAk-847OT-W_a92AW3lWEvEBSHYKITOZg4BBOQixwsQ9cTtAv-czQxic6PYch3iqxi2FQ1bfIWmrZ08DEGY__lTP8w2iWZnB9SkK4_St5OpMnf-nImiKidGbRpXTA6ida7I_QPaWyD6Q |
| CitedBy_id | crossref_primary_10_1016_j_dam_2023_09_013 crossref_primary_10_1016_j_ejc_2020_103203 crossref_primary_10_1007_s40819_020_0778_9 crossref_primary_10_1016_j_dam_2022_03_020 crossref_primary_10_1016_j_tcs_2021_08_029 crossref_primary_10_1016_j_tcs_2020_05_023 crossref_primary_10_1002_jgt_23108 crossref_primary_10_1016_j_heliyon_2024_e34434 crossref_primary_10_1142_S1793830924500101 crossref_primary_10_1016_j_amc_2024_129097 |
| Cites_doi | 10.1016/j.dam.2014.06.003 10.1016/j.disc.2007.03.066 10.1093/comjnl/bxr037 10.1016/j.disc.2005.11.029 10.1137/0405048 10.1016/j.dam.2013.06.024 10.1137/S0895480102417768 10.26637/mjm102/004 10.1016/j.dam.2009.11.014 10.1016/j.disc.2015.02.016 10.1016/j.endm.2015.05.019 10.1016/j.endm.2015.05.043 10.1155/2013/201654 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier B.V. Copyright Elsevier BV Jan 30, 2017 |
| Copyright_xml | – notice: 2016 Elsevier B.V. – notice: Copyright Elsevier BV Jan 30, 2017 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
| DOI | 10.1016/j.dam.2016.09.019 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1872-6771 1571-0653 |
| EndPage | 122 |
| ExternalDocumentID | 10.1016/j.dam.2016.09.019 10_1016_j_dam_2016_09_019 S0166218X16304115 |
| GroupedDBID | -~X ADEZE AFTJW ALMA_UNASSIGNED_HOLDINGS FDB OAUVE AAYXX AI. CITATION FA8 VH1 WUQ 7SC 8FD JQ2 L7M L~C L~D --K --M .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AASFE AATTM AAXKI AAXUO AAYWO ABAOU ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFO ACGFS ACNNM ACRLP ACRPL ACVFH ACXMD ADBBV ADCNI ADGUI ADMUD ADNMO ADTOC AEBSH AEIPS AEKER AEUPX AFPUW AGCQF AGHFR AGQPQ AGUBO AGYEJ AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AJMQA AKBMS AKRWK AKYEP AMRAJ ANKPU ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFKBS EJD EO8 EO9 EP2 EP3 FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM M41 MHUIS MO0 M~E N9A O-L O9- OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SDF SDG SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K UNPAY ~G- |
| ID | FETCH-LOGICAL-c368t-8519f96448262ffcbbafd0627ebb7589bb680797481dfef5b09ec5514c2730173 |
| IEDL.DBID | .~1 |
| ISSN | 0166-218X 1571-0653 |
| IngestDate | Tue Aug 19 09:07:28 EDT 2025 Mon Jun 30 17:01:49 EDT 2025 Thu Apr 24 23:03:35 EDT 2025 Tue Jul 01 01:43:05 EDT 2025 Sat Apr 29 22:45:09 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Trees Radio labeling Channel assignment Radio number |
| Language | English |
| License | publisher-specific-oa |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c368t-8519f96448262ffcbbafd0627ebb7589bb680797481dfef5b09ec5514c2730173 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9854-6076 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.dam.2016.09.019 |
| PQID | 1932053475 |
| PQPubID | 2045487 |
| PageCount | 13 |
| ParticipantIDs | unpaywall_primary_10_1016_j_dam_2016_09_019 proquest_journals_1932053475 crossref_primary_10_1016_j_dam_2016_09_019 crossref_citationtrail_10_1016_j_dam_2016_09_019 elsevier_sciencedirect_doi_10_1016_j_dam_2016_09_019 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2017-01-30 |
| PublicationDateYYYYMMDD | 2017-01-30 |
| PublicationDate_xml | – month: 01 year: 2017 text: 2017-01-30 day: 30 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Discrete Applied Mathematics |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V Elsevier BV |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier BV |
| References | Chartrand, Erwin, Zhang (br000035) 2005; 43 Li, Mak, Zhou (br000065) 2010; 158 West (br000105) 2001 Liu, Xie (br000080) 2009; 90 Liu (br000070) 2008; 308 Kola, Panigrahi (br000060) 2015; 48 Vaidya, Bantva (br000095) 2013; 2 Čada, Ekstein, Holub, Togni (br000020) 2013; 161 Liu, Xie (br000075) 2004; 169 Griggs, Yeh (br000045) 1992; 5 Calamoneri (br000025) 2011; 54 Chartrand, Erwin, Harary, Zhang (br000030) 2001; 33 Vaidya, Bantva (br000100) 2013; 82 Liu, Zhu (br000085) 2005; 19 Benson, Porter, Tomova (br000010) 2013; 68 Vaidya, Bantva (br000090) 2013; 2013 Bantva, Vaidya, Zhou (br000005) 2015; 48 Bhatti, Nisar, Kanwal (br000015) 2011; 3 Halász, Tuza (br000050) 2015; 338 Zhang (br000115) 2002; 65 Chartrand, Zhang (br000040) 2007; 2 King, Li, Zhou (br000055) 2014; 178 Yeh (br000110) 2006; 306 Liu (10.1016/j.dam.2016.09.019_br000075) 2004; 169 Vaidya (10.1016/j.dam.2016.09.019_br000100) 2013; 82 Bhatti (10.1016/j.dam.2016.09.019_br000015) 2011; 3 Chartrand (10.1016/j.dam.2016.09.019_br000035) 2005; 43 Bantva (10.1016/j.dam.2016.09.019_br000005) 2015; 48 Benson (10.1016/j.dam.2016.09.019_br000010) 2013; 68 Kola (10.1016/j.dam.2016.09.019_br000060) 2015; 48 Li (10.1016/j.dam.2016.09.019_br000065) 2010; 158 Zhang (10.1016/j.dam.2016.09.019_br000115) 2002; 65 Chartrand (10.1016/j.dam.2016.09.019_br000040) 2007; 2 Vaidya (10.1016/j.dam.2016.09.019_br000090) 2013; 2013 Halász (10.1016/j.dam.2016.09.019_br000050) 2015; 338 Liu (10.1016/j.dam.2016.09.019_br000080) 2009; 90 Čada (10.1016/j.dam.2016.09.019_br000020) 2013; 161 Liu (10.1016/j.dam.2016.09.019_br000070) 2008; 308 Vaidya (10.1016/j.dam.2016.09.019_br000095) 2013; 2 Griggs (10.1016/j.dam.2016.09.019_br000045) 1992; 5 Yeh (10.1016/j.dam.2016.09.019_br000110) 2006; 306 West (10.1016/j.dam.2016.09.019_br000105) 2001 King (10.1016/j.dam.2016.09.019_br000055) 2014; 178 Chartrand (10.1016/j.dam.2016.09.019_br000030) 2001; 33 Liu (10.1016/j.dam.2016.09.019_br000085) 2005; 19 Calamoneri (10.1016/j.dam.2016.09.019_br000025) 2011; 54 |
| References_xml | – volume: 2013 start-page: 1 year: 2013 end-page: 5 ident: br000090 article-title: Radio number for total graph of paths publication-title: ISRN Combin. – volume: 19 start-page: 610 year: 2005 end-page: 621 ident: br000085 article-title: Multi-level distance labelings for paths and cycles publication-title: SIAM J. Discrete Math. – volume: 33 start-page: 77 year: 2001 end-page: 85 ident: br000030 article-title: Radio labelings of graphs publication-title: Bull. Inst. Combin. Appl. – volume: 54 start-page: 1344 year: 2011 end-page: 1371 ident: br000025 article-title: The publication-title: Comput. J. – volume: 338 start-page: 1398 year: 2015 end-page: 1406 ident: br000050 article-title: Distance-constrained labeling of complete trees publication-title: Discrete Math. – volume: 82 start-page: 233 year: 2013 end-page: 245 ident: br000100 article-title: Radio number for linear cacti publication-title: Math. Student – volume: 178 start-page: 109 year: 2014 end-page: 120 ident: br000055 article-title: Linear and cyclic distance-three labelings of trees publication-title: Discrete Appl. Math. – volume: 158 start-page: 507 year: 2010 end-page: 515 ident: br000065 article-title: Optimal radio labelings of complete publication-title: Discrete Appl. Math. – volume: 3 start-page: 39 year: 2011 end-page: 57 ident: br000015 article-title: Radio number of wheel like graphs publication-title: Int. J. Appl. Graph Theory Wirel. ad hoc Netw. Sensor Netw. – volume: 43 start-page: 43 year: 2005 end-page: 57 ident: br000035 article-title: A graph labeling suggested by FM channel restrictions publication-title: Bull. Inst. Combin. Appl. – volume: 306 start-page: 1217 year: 2006 end-page: 1231 ident: br000110 article-title: A survey on labeling graphs with a condition at distance two publication-title: Discrete Math. – volume: 65 start-page: 21 year: 2002 end-page: 32 ident: br000115 article-title: Radio labeling of cycles publication-title: Ars Combin. – volume: 5 start-page: 586 year: 1992 end-page: 595 ident: br000045 article-title: Labeling graphs with condition at distance 2 publication-title: SIAM J. Discrete Math. – volume: 48 start-page: 135 year: 2015 end-page: 141 ident: br000005 article-title: Radio number of trees publication-title: Electron. Notes Discrete Math. – volume: 169 start-page: 105 year: 2004 end-page: 125 ident: br000075 article-title: Radio number of square cycles publication-title: Congr. Numer. – volume: 48 start-page: 289 year: 2015 end-page: 296 ident: br000060 article-title: Radio numbers of some caterpillars publication-title: Electron. Notes Discrete Math. – volume: 90 start-page: 307 year: 2009 end-page: 319 ident: br000080 article-title: Radio number of square paths publication-title: Ars Combin. – volume: 161 start-page: 2876 year: 2013 end-page: 2884 ident: br000020 article-title: Radio labeling of distance graphs publication-title: Discrete Appl. Math. – volume: 308 start-page: 1153 year: 2008 end-page: 1164 ident: br000070 article-title: Radio number for trees publication-title: Discrete Math. – volume: 2 start-page: 29 year: 2013 end-page: 36 ident: br000095 article-title: Radio number for strong product publication-title: Malaya J. Math. – year: 2001 ident: br000105 article-title: Introduction to Graph Theory – volume: 2 start-page: 237 year: 2007 end-page: 252 ident: br000040 article-title: Radio colorings of graphs — a survey publication-title: Int. J. Comput. Appl. Math. – volume: 68 start-page: 167 year: 2013 end-page: 190 ident: br000010 article-title: The radio numbers of all graphs of order publication-title: Le Mathematiche – volume: 82 start-page: 233 year: 2013 ident: 10.1016/j.dam.2016.09.019_br000100 article-title: Radio number for linear cacti publication-title: Math. Student – volume: 178 start-page: 109 year: 2014 ident: 10.1016/j.dam.2016.09.019_br000055 article-title: Linear and cyclic distance-three labelings of trees publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2014.06.003 – volume: 308 start-page: 1153 year: 2008 ident: 10.1016/j.dam.2016.09.019_br000070 article-title: Radio number for trees publication-title: Discrete Math. doi: 10.1016/j.disc.2007.03.066 – volume: 68 start-page: 167 year: 2013 ident: 10.1016/j.dam.2016.09.019_br000010 article-title: The radio numbers of all graphs of order n and diameter n−2 publication-title: Le Mathematiche – volume: 54 start-page: 1344 issue: 8 year: 2011 ident: 10.1016/j.dam.2016.09.019_br000025 article-title: The L(h,k)-labeling problem: An updated survey and annotated bibliography publication-title: Comput. J. doi: 10.1093/comjnl/bxr037 – volume: 306 start-page: 1217 year: 2006 ident: 10.1016/j.dam.2016.09.019_br000110 article-title: A survey on labeling graphs with a condition at distance two publication-title: Discrete Math. doi: 10.1016/j.disc.2005.11.029 – volume: 5 start-page: 586 issue: 4 year: 1992 ident: 10.1016/j.dam.2016.09.019_br000045 article-title: Labeling graphs with condition at distance 2 publication-title: SIAM J. Discrete Math. doi: 10.1137/0405048 – volume: 169 start-page: 105 year: 2004 ident: 10.1016/j.dam.2016.09.019_br000075 article-title: Radio number of square cycles publication-title: Congr. Numer. – volume: 161 start-page: 2876 issue: 18 year: 2013 ident: 10.1016/j.dam.2016.09.019_br000020 article-title: Radio labeling of distance graphs publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2013.06.024 – volume: 90 start-page: 307 year: 2009 ident: 10.1016/j.dam.2016.09.019_br000080 article-title: Radio number of square paths publication-title: Ars Combin. – volume: 3 start-page: 39 issue: 4 year: 2011 ident: 10.1016/j.dam.2016.09.019_br000015 article-title: Radio number of wheel like graphs publication-title: Int. J. Appl. Graph Theory Wirel. ad hoc Netw. Sensor Netw. – volume: 33 start-page: 77 year: 2001 ident: 10.1016/j.dam.2016.09.019_br000030 article-title: Radio labelings of graphs publication-title: Bull. Inst. Combin. Appl. – year: 2001 ident: 10.1016/j.dam.2016.09.019_br000105 – volume: 2 start-page: 237 issue: 3 year: 2007 ident: 10.1016/j.dam.2016.09.019_br000040 article-title: Radio colorings of graphs — a survey publication-title: Int. J. Comput. Appl. Math. – volume: 19 start-page: 610 year: 2005 ident: 10.1016/j.dam.2016.09.019_br000085 article-title: Multi-level distance labelings for paths and cycles publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480102417768 – volume: 43 start-page: 43 year: 2005 ident: 10.1016/j.dam.2016.09.019_br000035 article-title: A graph labeling suggested by FM channel restrictions publication-title: Bull. Inst. Combin. Appl. – volume: 2 start-page: 29 issue: 1 year: 2013 ident: 10.1016/j.dam.2016.09.019_br000095 article-title: Radio number for strong product P2⊠Pn publication-title: Malaya J. Math. doi: 10.26637/mjm102/004 – volume: 158 start-page: 507 year: 2010 ident: 10.1016/j.dam.2016.09.019_br000065 article-title: Optimal radio labelings of complete m-ary trees publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2009.11.014 – volume: 65 start-page: 21 year: 2002 ident: 10.1016/j.dam.2016.09.019_br000115 article-title: Radio labeling of cycles publication-title: Ars Combin. – volume: 338 start-page: 1398 year: 2015 ident: 10.1016/j.dam.2016.09.019_br000050 article-title: Distance-constrained labeling of complete trees publication-title: Discrete Math. doi: 10.1016/j.disc.2015.02.016 – volume: 48 start-page: 135 year: 2015 ident: 10.1016/j.dam.2016.09.019_br000005 article-title: Radio number of trees publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2015.05.019 – volume: 48 start-page: 289 year: 2015 ident: 10.1016/j.dam.2016.09.019_br000060 article-title: Radio numbers of some caterpillars publication-title: Electron. Notes Discrete Math. doi: 10.1016/j.endm.2015.05.043 – volume: 2013 start-page: 1 year: 2013 ident: 10.1016/j.dam.2016.09.019_br000090 article-title: Radio number for total graph of paths publication-title: ISRN Combin. doi: 10.1155/2013/201654 |
| SSID | ssj0001218 ssj0000186 ssj0006644 |
| Score | 2.3174598 |
| Snippet | A radio labeling of a graph G is a mapping f:V(G)→{0,1,2,…} such that |f(u)−f(v)|≥diam(G)+1−d(u,v) for every pair of distinct vertices u,v of G, where diam(G)... A radio labeling of a graph G is a mapping f : V(G) → {0, 1, 2, ...} such that | f(u) - f(v)| ≥ diam(G) + 1 - d(u,v) for every pair of distinct vertices u,v of... |
| SourceID | unpaywall proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 110 |
| SubjectTerms | Channel assignment Integer programming Labeling Marking Radio Radio labeling Radio number Radio programming Studies Trees |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwEA6yPeiL88fE6ZQ--KR0dP2RtI9DHENwiDiYTyFJE1BHN1yH6F_vXZuOKTr1PQfJJel9X-_yHSFnAUTx1GPSNVoKF_iGRA3I2A1FF7NYvid9fI18M6SDUXg9jsZWLBrfwnzK3xd1WKnAB-NdWsiRosBnnUYAu2ukPhre9h4KPVSG1TtRUGUtv7P7Ke6s4MrNRTYTb69iMlkJMf1GWZw1L5QJsbLkubPIZUe9f9Ft_NPsd8i2BZpOrzwZu2RDZ3ukUTVxcOyd3ifNO5E-Tp2yM4gzNQ6mqedNMupf3V8OXNsrwVUBjXMXXJ6YBMmWT31jlJTCpChBrKUESpBISWOPAXkAfGq0iaSXaIVoSfl4x1lwQGrZNNOHxJFM-VRT4H1KhywQcRwB6REKwqk2QDdbxKs8yZUVEsd-FhNeVYw9cVg2x2VzL-Gw7BY5X5rMShWNdYPDanu4hQFleOfg3nVm7Worub2Hc47wFD4zIYta5GK5vb_P4ehfo4_Jlo_R3sNfeW1Sy18W-gSwSi5P7Sn9ABdx35s priority: 102 providerName: Unpaywall |
| Title | Radio number of trees |
| URI | https://dx.doi.org/10.1016/j.dam.2016.09.019 https://www.proquest.com/docview/1932053475 https://doi.org/10.1016/j.dam.2016.09.019 |
| UnpaywallVersion | publishedVersion |
| Volume | 217 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-6771 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection customDbUrl: eissn: 1872-6771 dateEnd: 20211015 omitProxy: true ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: ACRLP dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-6771 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-6771 dateEnd: 20211030 omitProxy: true ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: AIKHN dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect customDbUrl: eissn: 1872-6771 dateEnd: 20211102 omitProxy: true ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: IXB dateStart: 19790901 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6771 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: AKRWK dateStart: 19790901 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA9DH5wP4sfE6Rx98Emp60eato9zODZlQ9RBfQpJm8BkdMNtiC_-7d71Y06QCT6mNCW9JHe_y-V-R8iFC1Y8sXxpaiWFCf6GRA7IwKTCxiiWY0kHs5EHQ9Yb0bvIiyqkU-bC4LXKQvfnOj3T1sWTViHN1mw8bj0BWGFgoCJAFBa1s0RzSn2sYnD9aa9RSCE_WrU8dPmOMYCtpQXzNzPxO2XMM7v9lQhMU7dZRoKKNDy_W601VLqzTGfi411MJmsGqrtP9gpkabTzwR-QikoPye5gRcs6PyK1R5GMp0ZeBcSYagND0vMaGXVvnzs9s6iLYMYuCxYmiDfUITpWDnO0jqUUOkG6YSUlwP9QShZYPjgKgEW10p60QhUjMood3M--e0y20mmqTogh_dhhioGPFyvquyIIPHBwRAymU2lwLevEKv-bxwVpONaumPDydtgrB1FxFBW3Qg6iqpPLVZdZzpix6WVaCpP_mHYOGn1Tt0YpeF7suTlHKAoqhfpenVytJuPvMZz-bwxnpOqgibfw_K5BthZvS3UOAGUhm9kKbJLtdv--N4RWP7qB1mj40H75AuGL37c |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PT8IwFG4IHsCD8QdGFHUHT5rJ2I9uOxoiQQUOCgm3pu3aBEMGEYjx4t_ue1uHmBhMvC7r0r22731fX99XQq48iOKJEwpbK8Ft4BsCNSAj2-ctzGK5jnCxGrk_oN2R_zgOxiXSLmph8Fil8f25T8-8tXnSNNZszieT5guAFQoBagyIwvFbWGi-4wduiAzs9rO1oSGFAmnVYtflO8kAwdY30t_Uxg8VSc_s-FfCsU69RTMVVNTh-T1sbcDSyiqd8493Pp1uRKjOPtkz0NK6y3t_QEoqPSS7_bUu6-KI1J55MplZ-TUg1kxbmJNe1Miocz9sd21zMYItPRotbbBvrGNkVi51tZZCcJ2g3rASAvB_LASNnBCYAoBRrXQgnFhJhEbSxQUdeseknM5SdUIsEUqXKgokTyo_9HgUBcBwuITYqTRwyzpxiv9m0qiG4-UVU1YcD3tlYCqGpmJOzMBUdXK9bjLPJTO2vewXxmQ_xp2BS9_WrFEYnplFt2CIRcGn-GFQJzfrwfi7D6f_68MlqXSH_R7rPQyezkjVxXjv4GZeg5SXbyt1DmhlKS6y2fgF-tXemA |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwEA6yPeiL88fE6ZQ--KR0dP2RtI9DHENwiDiYTyFJE1BHN1yH6F_vXZuOKTr1PQfJJel9X-_yHSFnAUTx1GPSNVoKF_iGRA3I2A1FF7NYvid9fI18M6SDUXg9jsZWLBrfwnzK3xd1WKnAB-NdWsiRosBnnUYAu2ukPhre9h4KPVSG1TtRUGUtv7P7Ke6s4MrNRTYTb69iMlkJMf1GWZw1L5QJsbLkubPIZUe9f9Ft_NPsd8i2BZpOrzwZu2RDZ3ukUTVxcOyd3ifNO5E-Tp2yM4gzNQ6mqedNMupf3V8OXNsrwVUBjXMXXJ6YBMmWT31jlJTCpChBrKUESpBISWOPAXkAfGq0iaSXaIVoSfl4x1lwQGrZNNOHxJFM-VRT4H1KhywQcRwB6REKwqk2QDdbxKs8yZUVEsd-FhNeVYw9cVg2x2VzL-Gw7BY5X5rMShWNdYPDanu4hQFleOfg3nVm7Worub2Hc47wFD4zIYta5GK5vb_P4ehfo4_Jlo_R3sNfeW1Sy18W-gSwSi5P7Sn9ABdx35s |
| 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=Radio+number+of+trees&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Bantva%2C+Devsi&rft.au=Vaidya%2C+Samir&rft.au=Zhou%2C+Sanming&rft.date=2017-01-30&rft.issn=0166-218X&rft.volume=217&rft.spage=110&rft.epage=122&rft_id=info:doi/10.1016%2Fj.dam.2016.09.019&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2016_09_019 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon |