AbstractKotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et al. proposed the conjecture that every tree is a super (a,0)-edge-antimagic total graph. In this paper, we formulate a super (a,d)-edge-antimagic total labeling on the subdivided star T(n,n,n+4,n+4,n5,n6...,nr) for d∈{0,1,2}, where r≥5, np=2p−4(n+3)+1, 5≤p≤r and n≥3 is odd
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
For a graph G = (V,E), a bijection g from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called (a, ...
Kotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et al. prop...
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic tot...
Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic to...
AbstractKotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et ...
The concept of labeling has its origin in the works of Stewart (1966), Kotzig and Rosa (1970). Later...
An (a, d)-edge antimagic total (EAT) labeling on a graph Γ with p vertices and q edges is a one-to-o...
An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V(G) ∪ E(G) ont...
An <i>(a,d)-edge antimagic total labeling of a (p, q)</i>-graph G is bijection f:V∪E→{1,2,3,…,p+q} w...
Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This pape...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
An undirected graph G is said to be simple if it has no multi-edges and self-loops. If G is connecte...
An (a,d)-edge-antimagic total labeling of a graph G(V, E) is a one-to-one map ƒ from V(G) ∪ E(G) ont...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
For a graph G = (V,E), a bijection g from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called (a, ...
Kotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et al. prop...
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic tot...
Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic to...
AbstractKotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et ...
The concept of labeling has its origin in the works of Stewart (1966), Kotzig and Rosa (1970). Later...
An (a, d)-edge antimagic total (EAT) labeling on a graph Γ with p vertices and q edges is a one-to-o...
An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V(G) ∪ E(G) ont...
An <i>(a,d)-edge antimagic total labeling of a (p, q)</i>-graph G is bijection f:V∪E→{1,2,3,…,p+q} w...
Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This pape...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
An undirected graph G is said to be simple if it has no multi-edges and self-loops. If G is connecte...
An (a,d)-edge-antimagic total labeling of a graph G(V, E) is a one-to-one map ƒ from V(G) ∪ E(G) ont...
Let ( ) and ( ) be simple and finite graphs, and be a subgraph of . Let | | | | | | dan | | . Cov...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
For a graph G = (V,E), a bijection g from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called (a, ...
DOI
Add to ORKG