Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs (Q668167): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4236613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-magic labelings of regular graphs. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on strong magic labelings of 2-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(E\)-super vertex magic labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On super vertex-magic labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super vertex-magic labeling. / rank
 
Normal rank

Revision as of 18:40, 18 July 2024

scientific article
Language Label Description Also known as
English
Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs
scientific article

    Statements

    Solution to some open problems on \(E\)-super vertex magic labeling of disconnected graphs (English)
    0 references
    18 March 2019
    0 references
    vertex magic total labeling
    0 references
    \(V\)-super vertex magic labeling
    0 references
    \(E\)-super vertex magic labeling
    0 references

    Identifiers