Consecutive magic graphs
A finite simple \((p,q)\)-graph \(G\) is vertex-magic total if there is a bijective labeling \(f:V(G) \cup E(G) \rightarrow [1,p+q]\) such that there is a fixed constant \(\mu\) so that each sum of the labels of a vertex and its incident edges is equal to \(\mu\). This paper studies two generalizations of this notion. A vertex-magic total graph is \(a\)-vertex consecutive if \(f(V)=\{a+1, a+2, \dots , a+p\}\) and \(b\)-edge consecutive if \(f(E)=\{b+1, b+2, \dots, b+q\}\). The authors prove various fairly technical results relating to the minimum degrees of such graphs and to the parities of \(p\) and \(q\) in such graphs. They apply these to obtain partial results concerning which 2-regular graphs and complete bipartite graphs \(K_{p,p}\) fail to be \(a\)-vertex consecutive magic and/or \(b\)-edge consecutive magic.
This page was built for publication: Consecutive magic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501555)
