Antimagicness of some families of generalized graphs

zbMATH Open1256.05219MaRDI QIDQ2906855FDOQ2906855

Authors: Mirka Miller, Oudone Phanalasy, Joe Ryan, Leanne Rylands 

Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p179.pdf

Recommendations

• On antimagic labeling for generalized web and flower graphs
• Antimagicness for a family of generalized antiprism graphs
• Antimagic labeling of generalized sausage graphs
• Antimagic labeling of generalized pyramid graphs
• Construction for antimagic generalized web graphs

zbMATH Keywords

edge labelingantimagic graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (14)

• The antistrong property for special digraph families
• Antimagicness of generalized corona and snowflake graphs
• Antimagic vertex labelings of hypergraphs
• Weighted-1-antimagic graphs of prime power order
• Antimagicness for a family of generalized antiprism graphs
• On antimagic labeling for generalized web and flower graphs
• Title not available (Why is that?)
• Tree-antimagicness of disconnected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On super antimagicness of generalized flower and disk brake graphs
• Magic and antimagic labeling of \(m\) copies of flower snark and related graphs
• Construction for antimagic generalized web graphs
• Antimagic labeling of generalized sausage graphs

This page was built for publication: Antimagicness of some families of generalized graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906855)