Edge-antimagic graphs (Q878610): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.10.038 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2143872479 / rank | |||
Normal rank |
Revision as of 21:08, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Edge-antimagic graphs |
scientific article |
Statements
Edge-antimagic graphs (English)
0 references
26 April 2007
0 references
A bijection \(g: V(G) \cup E(G) \rightarrow \{1, 2, \dots , | V(G)| +| E(G)| \}\) is called an \((a,d)\)-edge-antimagic total labeling of graph \(G\) if the edge-weights \(g(x)+g(xy)+g(y)\) over all edges \(xy\) form an arithmetic progression with initial term \(a\) and difference \(d\). Such a labeling is super if \(g(V(G))=\{1,2,\dots,| V(G)|\} \). The authors calculate properties of \(a\) and \(d\) for which various families of graphs have such labelings.
0 references
edge antimagic total labelings
0 references