Computing edge weights of magic labeling on rooted products of graphs
From MaRDI portal
Publication:2004217
DOI10.1155/2020/2160104zbMath1459.05288OpenAlexW3089702487MaRDI QIDQ2004217
Muhammad Javaid, Hafiz Usman Afzal, Jia-Bao Liu
Publication date: 14 October 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/2160104
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- On super edge-antimagic total labeling of subdivided stars
- On anti-magic labeling for graph products
- Antimagicness of generalized corona and snowflake graphs
- On super \((a, d)\)-edge-antimagic total labeling of generalized extended \(w\)-trees.
- Super \((a,d)\)-edge antimagic total labeling of a subclass of trees
- On antimagic labellings of some cycle related graphs
- A magical approach to some labeling conjectures
- A Graph Theoretic Approach for Modeling Mobile Robot Team Formations
- Formulas and algorithms of antimagic labelings of some helm related graphs
- On Super Edge-Magic Strength and Deficiency of Graphs
- Combinatorial Geometry and Graph Theory
- Magic Graphs
- Magic Valuations of Finite Graphs
- The place of super edge-magic labelings among other classes of labelings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing edge weights of magic labeling on rooted products of graphs