H-E-Super magic graceful labelings of graphs
H-E-SMGL
Keywords:
$H$-covering, $H$-magic labeling, $H$-$E$-super magic graceful labeling.Abstract
Let $G$ be a simple graph with $p$ vertices and $q$ edges. A simple graph $G$ admits an $H$-covering in $E(G)$ belongs to a subgraph of $G$ isomorphic to $H$. The graph $G$ is said to be $H$-magic if there exists an one one onto $\mu$ from $V(G) \cup E(G)$ onto $\rightarrow \{ 1,2 , \ldots, p + q \}$ such that for every subgraph $H^{'}$ of $G$ isomorphic to $H$, $ \sum\limits_{v \in V(H^{'})} \mu(v) + \sum\limits_{e \in E(H^{'})} \mu(e) = M$ for some positive integer $M$. An $H$-$E$-super magic graceful labeling ($H$-$E$-SMGL) is an one one onto $\mu$ from $V(G) \cup E(G)$ onto $\rightarrow \{ 1,2 , \ldots, p + q \}$ with the condition that $\mu(E(G)) = \{ 1,2 , \ldots, q\}$ such that, $ \sum\limits_{v \in V(H^{'})} \mu(v) - \sum\limits_{e \in E(H^{'})} \mu(e) = M$. In this paper, we study $H$-$E$-SMGL of fans, graphs obtained by joining a star $K_{1,n}$ with one isolated vertex, books and grids.
Downloads
References
bibitem{jos15} J.A. Gallian, A Dynamic Survey of Graph Labeling, emph{Electron. J. Combin.,} (2023), #DS6.
bibitem{l2005} A. Gutierrez, A. Lladó, Magic coverings, emph{J. Combin. Math. Combin. Comput}. textbf{55} (2005), 43 -- 56.
bibitem{Golomb72} S. W. Golomb, How to number a graph, in Graph Theory and Computing, emph{ R.C. Road, ed., Academic Press, New York} (1972), 23-37.
bibitem{l2007} A. Lladó, J. Moragas, Cycle-magic graphs, emph{Discrete Math}. textbf{307 (23)} (2007), 2925 -- 2933.
%bibitem{mari12} G. Marimuthu and M.Balakrishnan, {it E-super vertex magic labeling of graphs}, Discrete Appl. Math. textbf{160} (2012) 1766-1774.
bibitem{Rosa67} A. Rosa,{it On certain valuations of the vertices of a graph}, emph{Theory of Graphs(Inter. Nat. Sym. Rome} July 1966), Gordon and Breach, N.Y. and Dunod
Paris, (1967), 349 -- 355.
bibitem{sed63} Sedl$grave{a}check{c}$ek, Problem 27, in Theory of Graphs and its Applications, emph{Proc. Symposium Smolenice}, June (1963), 163 -- 167.
bibitem{sindhu} Sindhu Murugan and S. Chandra Kumar, $C_{m}-E$-Super magic graceful labeling of graphs, emph{Malaya journal of matematik} textbf{7(4)} (2019), 716 -- 719.
bibitem{skumar} S. StalinKumar, G. Marimuthu, $H$-$E$-super Magic decomposition of complete bipartite graphs, emph{Electron. Notes Discrete Math} textbf{48}(2015), 297 -- 300.
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
