H-E-super magic decomposition of complete bipartite graphs
From MaRDI portal
Publication:324984
DOI10.1016/J.ENDM.2015.05.044zbMATH Open1347.05200OpenAlexW4242475551MaRDI QIDQ324984FDOQ324984
Authors: S. Stalin Kumar, G. Marimuthu
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.05.044
Recommendations
- \(H\)-\(V\)-super magic decomposition of complete bipartite graphs
- \(H\)-\(E\)-super magic decomposition of graphs
- Star-supermagic decompositions of the complete bipartite graph minus a one-factor
- Some cycle-(super)magic labelings of some complete bipartite graphs
- Cycle-supermagic decompositions of complete multipartite graphs
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Chromatic graph theory
- A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
- Cycle-magic graphs
- \(H\)-\(V\)-super magic decomposition of complete bipartite graphs
- \(H\)-\(E\)-super magic decomposition of graphs
- Magic coverings
- Cycle-supermagic decompositions of complete multipartite graphs
- \(H\)-supermagic labelings of graphs
Cited In (11)
- Star-supermagic decompositions of the complete bipartite graph minus a one-factor
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(H\)-\(V\)-super magic decomposition of complete bipartite graphs
- \(H\)-\(V\)-super magic decomposition of complete bipartite graphs
- Cycle-supermagic decompositions of complete multipartite graphs
- On super edge-magic decomposable graphs
- \(H\)-\(E\)-super magic decomposition of graphs
- \(C_m\)-\(E\)-supermagic labeling of graphs
- Some cycle-(super)magic labelings of some complete bipartite graphs
- \(H\)-\(V\)-super-strong-\((a,d)\)-antimagic decomposition of complete bipartite graphs.
This page was built for publication: \(H\)-\(E\)-super magic decomposition of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324984)