Ladders and fan graphs are cycle-antimagic
Sign Up to like & getrecommendations! Published in 2019 at "Hacettepe Journal of Mathematics and Statistics"
DOI: 10.15672/hujms.647228
Abstract: A simple graph G = (V,E) admits an H-covering if every edge in E belongs to at least one subgraph of G isomorphic to a given graph H. The graph G admitting an H-covering is… read more here.
Keywords: ladders fan; graphs cycle; fan graphs; cycle antimagic ... See more keywords