On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs (Q364571): 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.1155/2013/896815 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2052999219 / rank | |||
Normal rank |
Revision as of 19:37, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs |
scientific article |
Statements
On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs (English)
0 references
9 September 2013
0 references
Summary: For a graph \(G = (V, E)\), a bijection \(f\) from \(V(G) \cup E(G) \to \{1, 2, \dots, |V(G)| + |E(G)|\}\) is called \((a, d)\)-edge-antimagic total (\((a, d)\)-EAT) labeling of \(G\) if the edge-weights \(w(xy) = f(x) + f(y) + f(xy)\), \(xy \in E(G)\) form an arithmetic progression starting from \(a\) and having a common difference \(d\), where \(a > 0\) and \(d \geq 0\) are two fixed integers. An \((a, d)\)-EAT labeling is called super \((a, d)\)-EAT labeling if the vertices are labeled with the smallest possible numbers; that is, \(f(V) = \{1, 2, \dots, |V(G)|\}\). In this paper, we study super \((a, d)\)-EAT labeling of cycles with some pendant edges attached to different vertices of the cycle.
0 references