Super edge-magic total labeling of a tree

Publication date 11 November 2013

Published in Utilitas Mathematica (Search for Journal in Brave)

\(w\)-tree caterpillar super edge-magic total labeling

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

A super edge-magic total labeling of a graph \(G\) is a one-to-one map \(\lambda : V(G)\cup E(G)\rightarrow \{1,2,\ldots |V(G)\cup E(G)|\}\) with the properties that there is an integer constant \(c\) such that \(\lambda (x)+\lambda (xy)+\lambda (y)=c\) for any \(xy\in E(G)\) and \(\lambda (V(G))=\{1,2,\ldots ,|V(G)|\}\). In this paper the authors define a \(w\)-tree depending on a parameter \(k\) (for \(k=2\) this is a caterpillar) and deduce, in a constructive way, some sufficient conditions implying that \(w\)-trees as well as disjoint union of isomorphic and non-isomorphic copies of \(w\)-trees have a super edge-magic total labeling for some constant \(c\).

Recommendations

Cited in

(12)

This page was built for publication: Super edge-magic total labeling of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860834)