Results 131 to 140 of about 412,708 (144)
Some of the next articles are maybe not open access.
A class of totally antimagic total graphs
Australas. J Comb., 2016Summary: A total labeling of a graph \(G\) is a bijection from the vertex set and edge set of \(G\) onto the set \(\{1,2,\dots,|V(G)|+|E(G)|\}\). Such a labeling \(\xi\) is vertex-antimagic (edge-antimagic) if all vertex-weights \(wt\xi (v)=\xi(v)+\sum_{vu\in E(G)}\xi(vu)\), \(v\in V(G)\), (all edge-weights \(wt_\xi(vu)=\xi(v)+\xi(vu)+\xi(u)\), \(vu\in
openaire +2 more sources
Antimagic Properties of Graphs with Large Maximum Degree
Journal of Graph Theory, 2013Zelealem Yilma
exaly
Two constructions of H-antimagic graphs
AKCE International Journal of Graphs and Combinatorics, 2017Martin Baca +2 more
exaly
Some Distance Antimagic Labeled Graphs
Lecture Notes in Computer Science, 2016Aloysius Godinho, Tarkeshwar Singh
exaly