On \(k\)-edge-magic labelings of maximal outerplanar graphs (Q896094): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Magic Valuations of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON SUPER EDGE-MAGIC LABELING OF SOME GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lucky choice number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3015615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3165989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5295617 / rank
 
Normal rank

Revision as of 04:32, 11 July 2024

scientific article
Language Label Description Also known as
English
On \(k\)-edge-magic labelings of maximal outerplanar graphs
scientific article

    Statements

    On \(k\)-edge-magic labelings of maximal outerplanar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    In this paper it is proven that a maximal outerplanar graph of order \(p= 4, 5\) or \(7\) admits a \(k\)-edge labeling if and only if \(k\equiv 2\pmod{p}\). The authors conjecture that the result can be extended to any maximal outerplanar graph of order \(p\) where \(p\) is a prime.
    0 references
    edge-magic labeling
    0 references
    outerplanar graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references