Super edge-magic total strength of some unicyclic graphs

arXiv2212.05329MaRDI QIDQ6420145FDOQ6420145

Author name not available (Why is that?)

Publication date: 10 December 2022

Abstract: Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such that $p=|V(G)|$ and $q=|E(G)|$. A super edge-magic total labeling $f$ of $G$ is a bijection $fcolonV(G)cupE(G)longrightarrow1,2,dots,p+q$ such that for all edges $uvinE(G)$, $f(u)+f(v)+f(uv)=c(f)$, where $c(f)$ is called a magic constant, and $f(V(G))=1,dots,p$. The minimum of all $c(f)$, where the minimum is taken over all the super edge-magic total labelings $f$ of $G$, is defined to be the super edge-magic total strength of the graph $G$. In this article, we work on certain classes of unicyclic graphs and provide shreds of evidence to conjecture that the super edge-magic total strength of a certain family of unicyclic $(p,q)$-graphs is equal to $2q+fracn+32$.

Mathematics Subject Classification ID

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

This page was built for publication: Super edge-magic total strength of some unicyclic graphs

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