A Dynamic Survey of Graph Labeling
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done f...
Gespeichert in:
Veröffentlicht in: | The Electronic journal of combinatorics 2022-12, Vol.1000 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | The Electronic journal of combinatorics |
container_volume | 1000 |
creator | Gallian, Joseph A. |
description | A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word "new" in the right margin. |
doi_str_mv | 10.37236/11668 |
format | Article |
fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_37236_11668</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_37236_11668</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1668-22e4c2fc5045c2354f738e1867194781b1cfe423ddf43360a62d5f8a6f7734c63</originalsourceid><addsrcrecordid>eNpNj0tLAzEURkOxYG31NwQX7kZz781rlqXaKgy4UNdDmsmtI32RoDD_XqwuXJ1vdT6OEFegbskh2TsAa_1ITEA5V_ka7dm_fS4uSvlQCrCuzURcz-X9sA-7PsqXz_yVBnlgucrh-C6bsE7bfr-ZiTGHbUmXf5yKt-XD6-Kxap5XT4t5U8Wfvwox6YgcjdImIhnNjnwCbx3U2nlYQ-SkkbqONZFVwWJn2AfLzpGOlqbi5tcb86GUnLg95n4X8tCCak9l7amMvgEX7Ty2</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Dynamic Survey of Graph Labeling</title><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Gallian, Joseph A.</creator><creatorcontrib>Gallian, Joseph A.</creatorcontrib><description>A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word "new" in the right margin.</description><identifier>ISSN: 1077-8926</identifier><identifier>EISSN: 1077-8926</identifier><identifier>DOI: 10.37236/11668</identifier><language>eng</language><ispartof>The Electronic journal of combinatorics, 2022-12, Vol.1000</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1668-22e4c2fc5045c2354f738e1867194781b1cfe423ddf43360a62d5f8a6f7734c63</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,860,27901,27902</link.rule.ids></links><search><creatorcontrib>Gallian, Joseph A.</creatorcontrib><title>A Dynamic Survey of Graph Labeling</title><title>The Electronic journal of combinatorics</title><description>A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word "new" in the right margin.</description><issn>1077-8926</issn><issn>1077-8926</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNpNj0tLAzEURkOxYG31NwQX7kZz781rlqXaKgy4UNdDmsmtI32RoDD_XqwuXJ1vdT6OEFegbskh2TsAa_1ITEA5V_ka7dm_fS4uSvlQCrCuzURcz-X9sA-7PsqXz_yVBnlgucrh-C6bsE7bfr-ZiTGHbUmXf5yKt-XD6-Kxap5XT4t5U8Wfvwox6YgcjdImIhnNjnwCbx3U2nlYQ-SkkbqONZFVwWJn2AfLzpGOlqbi5tcb86GUnLg95n4X8tCCak9l7amMvgEX7Ty2</recordid><startdate>20221202</startdate><enddate>20221202</enddate><creator>Gallian, Joseph A.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20221202</creationdate><title>A Dynamic Survey of Graph Labeling</title><author>Gallian, Joseph A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1668-22e4c2fc5045c2354f738e1867194781b1cfe423ddf43360a62d5f8a6f7734c63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gallian, Joseph A.</creatorcontrib><collection>CrossRef</collection><jtitle>The Electronic journal of combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gallian, Joseph A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Dynamic Survey of Graph Labeling</atitle><jtitle>The Electronic journal of combinatorics</jtitle><date>2022-12-02</date><risdate>2022</risdate><volume>1000</volume><issn>1077-8926</issn><eissn>1077-8926</eissn><abstract>A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word "new" in the right margin.</abstract><doi>10.37236/11668</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1077-8926 |
ispartof | The Electronic journal of combinatorics, 2022-12, Vol.1000 |
issn | 1077-8926 1077-8926 |
language | eng |
recordid | cdi_crossref_primary_10_37236_11668 |
source | DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
title | A Dynamic Survey of Graph Labeling |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T01%3A25%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Dynamic%20Survey%20of%20Graph%20Labeling&rft.jtitle=The%20Electronic%20journal%20of%20combinatorics&rft.au=Gallian,%20Joseph%20A.&rft.date=2022-12-02&rft.volume=1000&rft.issn=1077-8926&rft.eissn=1077-8926&rft_id=info:doi/10.37236/11668&rft_dat=%3Ccrossref%3E10_37236_11668%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |