On H-Supermagic Labelings of m-Shadow of Paths and Cycles
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of labels of all vertices and edges in H′ form an arit...
Saved in:
| Main Authors: | Ika Hesti Agustin, F. Susanto, Dafik, R. M. Prihandini, R. Alfarisi, I. W. Sudarsana |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2019/8780329 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On H-irregular reflexive labeling of graph
by: Marsidi Marsidi, et al.
Published: (2023-11-01) -
The Distance Irregular Reflexive k-Labeling of Graphs
by: Ika Hesti Agustin, et al.
Published: (2023-05-01) -
On Local Antimagic b-Coloring and Its Application for STGNN Time Series Forecasting on Horizontal Farming
by: R. Sunder, et al.
Published: (2025-03-01) -
Optimizing Data Classification in Support Vector Machines Using Metaheuristic Algorithms
by: Qonita Ilmi Awalin, et al.
Published: (2024-11-01) -
ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n ) AND THE LOTUS GRAPH(Lo_n )
by: R Adawiyah, et al.
Published: (2023-09-01)