C_m-supermagic labeling of graphs
From MaRDI portal
Publication:324959
DOI10.1016/J.ENDM.2015.05.028zbMATH Open1347.05194OpenAlexW795995092MaRDI QIDQ324959FDOQ324959
Authors: Km. Kathiresan, C. Chithra, G. Marimuthu
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.028
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- A dynamic survey of graph labeling
- Title not available (Why is that?)
- Title not available (Why is that?)
- Magic Valuations of Finite Graphs
- Cycle-magic graphs
- Magic graphs with pendant edges.
- On (super) edge-magic total labelings of a subdivision of a star \(S_n\)
- Title not available (Why is that?)
- \(P_h\)-supermagic labelings of some trees
- Magic coverings
- Title not available (Why is that?)
- \(H\)-supermagic labelings of graphs
Cited In (12)
- Further results on cycle-supermagic labeling
- Clique vertex magic cover of a graph
- Supermagic coverings of some simple graphs
- On supermagic coverings of fans and ladders
- --supermagic labeling of graphs
- \(H\)-supermagic strength of some graphs
- \(H\)-supermagic labelings of graphs
- Title not available (Why is that?)
- Magic coverings
- \(H\)-magic graphs
- Magic covering of chain of an arbitrary 2-connected simple graph
- On (F, H)-simultaneously-magic labelings of graphs
This page was built for publication: \(C_m\)-supermagic labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324959)