On \(k\)-minimum and \(m\)-minimum edge-magic injections of graphs

DOI10.1016/j.disc.2009.07.021zbMath1188.05122OpenAlexW2080190945MaRDI QIDQ1045143

John A. Trono, John P. McSorley

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.021

zbMATH Keywords

\(G\)-sequence\(k\)-minimum \(G\)-sequence\(m\)-minimum \(G\)-sequencedouble-witnessedge-magic injectionmagic strengthwell spread-sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

SAT and IP based algorithms for magic labeling including a complete search for total magic labelings

Uses Software

• OEIS

Cites Work

• Magic strength of a graph
• Dense edge-magic graphs and thin additive bases
• Magic Valuations of Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(k\)-minimum and \(m\)-minimum edge-magic injections of graphs