On the (consecutively) super edge-magic deficiency of subdivision of double stars

DOI10.1155/2020/4285238MaRDI QIDQ2228161zbMATH OpenOpenAlexFDO

Authors Vira Hari Krisnawati, A. A. G. Ngurah, Noor Hidayat, Abdul Rouf Alghofari

Publication date 16 February 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/4285238

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

Summary: Let \(G\) be a finite, simple, and undirected graph with vertex set \(V(G)\) and edge set \(E(G)\). A super edge-magic labeling of \(G\) is a bijection \(f:V(G)\cup E(G)\longrightarrow\{ 1,2,\dots,|V(G)| + |E(G)|\}\) such that \(f(V(G))=\{ 1,2,\dots,|V (G)|\}\) and \(f(u)+f(uv)+f(v)\) is a constant for every edge \(uv\in E(G)\). The super edge-magic labeling \(f\) of \(G\) is called consecutively super edge-magic if \(G\) is a bipartite graph with partite sets \(A\) and \(B\) such that \(f( A)=\{ 1,2,\dots,|A|\}\) and \(f(B)= \{|A|+1,|A|+2,\dots, |V(G)|\}\). A graph that admits (consecutively) super edge-magic labeling is called a (consecutively) super edge-magic graph. The super edge-magic deficiency of \(G\), denoted by \(\mu_s (G)\), is either the minimum nonnegative integer \(n\) such that \(G\cup nK_1\) is super edge-magic or \(+\infty\) if there exists no such \(n\). The consecutively super edge-magic deficiency of a graph \(G\) is defined by a similar way. In this paper, we investigate the (consecutively) super edge-magic deficiency of subdivision of double stars. We show that, some of them have zero (consecutively) super edge-magic deficiency.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: On the (consecutively) super edge-magic deficiency of subdivision of double stars

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