On antimagic labeling for generalized web and flower graphs

Joe Ryan, Oudone Phanalasy, Mirka Miller, Leanne Rylands

    Research output: Chapter in Book / Conference PaperConference Paperpeer-review

    11 Citations (Scopus)

    Abstract

    ![CDATA[An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling. Completely separating systems arose from certain problems in information theory and coding theory. Recently these systems have been shown to be useful in constructing antimagic labelings of particular graphs.]]
    Original languageEnglish
    Title of host publicationCombinatorial Algorithms: 21st International Workshop, IWOCA 2010 London, UK, July 26-28, 2010: Revised Selected Papers
    PublisherSpringer
    Pages303-313
    Number of pages11
    ISBN (Print)9783642192210
    Publication statusPublished - 2011
    EventInternational Workshop on Combinatorial Algorithms -
    Duration: 26 Jul 2010 → …

    Publication series

    Name
    ISSN (Print)0302-9743

    Conference

    ConferenceInternational Workshop on Combinatorial Algorithms
    Period26/07/10 → …

    Fingerprint

    Dive into the research topics of 'On antimagic labeling for generalized web and flower graphs'. Together they form a unique fingerprint.

    Cite this