×

Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs. (English) Zbl 1495.05311

Summary: A simple graph \(G(V, E)\) admits an \(H\)-covering, if every edge in \(E(G)\) belongs to a subgraph of \(G\) isomorphic to \(H\). The graph \(G\) is said to be \(H\)-magic, if there exists a bijection \(\psi : V(G) \cup E(G) \rightarrow \{1, 2, 3, \dots, |V(G)|+|E(G)|\}\) such that for every subgraph \(H^\prime\) of \(G\) isomorphic to \(H\), \(\sum\limits_{v\in V(H^\prime)}\psi(v)+\sum\limits_{v\in E(H^\prime)}\psi(e)\) is constant. Moreover \(G\) is said to be \(H\)-super magic, if \(\psi (V(G)) = \{1, 2, 3, \dots, |V(G)|\}\). In this paper, we study the cycle-super magic labeling of a pumpkin graph and two classes of planar maps containing 8-sided and 4-sided faces or 6-sided and 4-sided faces, respectively.

MSC:

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

Software:

NISPOC
Full Text: DOI

References:

[1] BaČa, M., On magic labelings of grid graphs, Ars Combin., 33, 295-299 (1992) · Zbl 0766.05075
[2] BaČa, M., On magic labelings of honeycomb, Discrete Math., 105, 305-311 (1992) · Zbl 0760.05075 · doi:10.1016/0012-365X(92)90153-7
[3] Enomoto, H.; Lladó, A.; Nakamigawa, T.; Ringel, G., Super edge magic graphs, SUT J. Math., 34, 105-109 (1998) · Zbl 0918.05090
[4] Gutiérrez, A.; Lladó, A., Magic coverings, J. Combin. Math. Combin. Comput., 55, 43-56 (2005) · Zbl 1101.05058
[5] Jeyanthi, P.; Selvagopal, P., More classes of H-super magic graphs, Int. J. Algor. Comp and Math., 3, 93-108 (2010) · Zbl 1216.05132
[6] Kathiresan, K.; Gokulakrishnan, S., On magic labelings of type (1,1,1) for the special classes of plane graphs, Utilitas Math., 63, 25-32 (2003) · Zbl 1035.05080
[7] Kotzig, A.; Rosa, A., Magic valuation of finite graphs, Canad. Math. Bull., 13, 4, 451-461 (1970) · Zbl 0213.26203
[8] Lih, K. W., On magic and consecutive labelings of plane graphs, Utilitas Math., 24, 165-197 (1983) · Zbl 0539.05058
[9] Lladó, A.; Moragas, J., Cycle-magic graphs, Discrete Math., 307, 23, 2925-2933 (2007) · Zbl 1127.05090
[10] Maryati, T. K.; Baskoro, E. T.; Salman, A. N.M., Ph-super magic labelings of some trees, J. Combin. Math. Combin. Comput., 65, 197-204 (2008) · Zbl 1171.05045
[11] Ngurah, A. A.G.; Salman, A. N.M.; Susilowati, L., H-super magic labeling of graphs, Discrete Math., 310, 1293-1300 (2010) · Zbl 1201.05082 · doi:10.1016/j.disc.2009.12.011
[12] Numan, M.; Ali, G.; Asif, M.; Fenovcikova, A. S., Cycle-supermagic labelling of some classes of plane graphs, Science Asia, 44, 129-134 (2018)
[13] Gao, Y.; Zhu, E.; Shao, Z.; Gutman, I.; Klobucar, A., Total domination and open packing in some chemical graphs, Journal of Mathematical Chemistry, 5, 1481-1492 (2018) · Zbl 1390.92162
[14] Shao, Z.; Virk, A. R.; Javed, M. S.; Rehman, M. A.; Farahani, M. R., Degree based graph invariants for the molecular graph of Bismuth Tri-Iodide, Eng. Appl. Sci. Lett, , 2, 1, 01-11 (2019)
[15] Shao, Z.; Wu, P.; Zhang, X.; Dimitrov, D.; Liu, J. B., On the maximum ABC index of graphs with prescribed size and without pendent vertices, IEEE Acces, , 6,, 27604-27616 (2018)
[16] Shao, Z.; Wu, P.; Gao, Y.; Gutman, I.; Zhang, X., On the maximum ABC index of graphs without pendent vertices, Applied Mathematics and Computatio, , 315,, 298-312 (2017) · Zbl 1426.05082 · doi:10.1016/j.amc.2017.07.075
[17] Shao, Z.; Siddiqui, M. K.; Muhammad, M. H., Computing Zagreb Indices and Zagreb Polynomials for Symmetrical Nanotubes, Symmetry, , (2018) · doi:10.3390/sym10070244
[18] Zhang, X.; Ibrahim, M.; Bokhary, S.; Siddiqui, M., Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs, Mathematics, 6, 1-10 (2018) · Zbl 1401.05265 · doi:10.3390/math6090142
[19] Zhang, X.; Siddiqui, M. K.; Naeem, M.; Baig, A. Q., Computing Eccentricity Based Topological Indices of Octagonal Grid Om, Mathematics, 6 (2018) · Zbl 1401.05077
[20] Zhang, X.; Wu, X.; Akhter, S.; Jamil, M. K.; Liu, J.-B.; Farahani, M. R., Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices of Generalized Bridge Molecular Graphs, Symmetry, 10, 12, 751-760 (2017) · Zbl 1425.92228 · doi:10.3390/sym10120751
[21] Zhang, X.; Shah, F. A.; Li, Y.; Yan, L.; Baig, A. Q.; Farahani, M. R., A family of fifth-order convergent methods for solving nonlinear equations using variational iteration technique, Journal of Information and Optimization Sciences, 39, 3, 673-694 (2018) · doi:10.1080/02522667.2018.1443628
[22] Yang, H.; Zhang, X., The independent domination numbers of strong product of two cycles, Journal of Discrete Mathematical Sciences and Cryptography., 21, 7-8, 1495-1507 (2018) · Zbl 1481.05120 · doi:10.1080/09720529.2017.1316988
[23] Zhang, X.; Jiang, H.; Liu, J.-B.; Shao, Z., The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices, Molecules, 23, 1-15 (2018) · doi:10.3390/molecules23071731
[24] Yan, L.; Li, Y.; Zhang, X.; Saqlain, M.; Zafar, S.; Farahani, M. R., 3-total edge product cordial labeling of some new classes of graphs, Journal of Information & Optimization Sciences, 39, 3, 705-724 (2018) · doi:10.1080/02522667.2017.1417727
[25] Zhang, X.; Shah, F. A.; Li, Y.; Yan, L.; Baig, A. Q.; Farahani, M. R., A family of fifth-order convergent methods for solving nonlinear equations using variational iteration technique, Journal of Information and Optimization Sciences, 39, 3, 673-694 (2018) · doi:10.1080/02522667.2018.1443628
[26] Ahmad, A.; Elahi, K.; Hasni, R.; Nadeem, M. F., Computing the degree based topological indices of line graph of benzene ring embedded in P-type-surface in 2D network, Journal of Information and Optimization Sciences, 40, 7, 1511-1528 (2019)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.