On (Super) Edge-Antimagic Total Labeling of Subdivided Stars

Javaid, M.; Mahboob, Sajid; Mahboob, Abid; Hussain, M.

doi:10.26708/ijmsc.2014.1.4.09

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Super edge-antimagic total labeling and super edge magic labeling for subdivided stars were made in [33][34][35]. Javaid et al [36] proved (a,d)-EAT labeling of extended w-trees and super edge-magic total labeling on w-trees was defined [37].…”

Section: Introductionmentioning

confidence: 99%

Role of Graph Theory to Facilitate Landscape Connectivity: Subdivision of a Harary Graph

Arif¹,

Afzal²,

Nadeem³

et al. 2018

Pol. J. Environ. Stud.

View full text Add to dashboard Cite

This work focuses on mapping landscape connectivity by making use of a subdivision of a Harary graph through super edge antimagic total labeling. This study employs a Harary graph by inserting h vertices in each edge, where h = 2n, n ≥ 1 using the super (a, 2) edge antimagic total labeling and labeling the vertices and edges by taking the difference of arithmetic progression as 2 i.e. d = 2. We divided this paper into two parts. In first part, when the order of the subdivided harary graphs p varies then the distance t will remain the same, while in the other part, when the order p varies then distance t will also vary.

show abstract

Section: Introductionmentioning

confidence: 99%

Role of Graph Theory to Facilitate Landscape Connectivity: Subdivision of a Harary Graph

Arif¹,

Afzal²,

Nadeem³

et al. 2018

Pol. J. Environ. Stud.

View full text Add to dashboard Cite

show abstract

“…In [7], Dafik et al proved super edge-antimagicness of a disjoint unionof m copies of C n . For most recent research in the subject, refer to [3,14,17,19,20,21]. We look at a computer network as a connected undirected graph.…”

Section: Introductionmentioning

confidence: 99%

Super edge-antimagic graceful labeling of graphs

Marimuthu¹,

Krishnaveni²

2015

Malaya J. Mat.

View full text Add to dashboard Cite

For a graph $G=(V, E)$, a bijection $g$ from $V(G) \cup E(G)$ into $\{1,2, \ldots,|V(G)|+|E(G)|\}$ is called $(a, d)$-edge-antimagic graceful labeling of $G$ if the edge-weights $w(x y)=|g(x)+g(y)-g(x y)|, x y \in E(G)$, form an arithmetic progression starting from $a$ and having a common difference $d$. An $(a, d)$-edge-antimagic graceful labeling is called super $(a, d)$-edge-antimagic graceful if $g(V(G))=\{1,2, \ldots,|V(G)|\}$. Note that the notion of super $(a, d)$-edge-antimagic graceful graphs is a generalization of the article "G. Marimuthu and $\mathrm{M}$. Balakrishnan, Super edge magic graceful graphs, Inf.Sci.287( 2014)140-151", since super $(a, 0)$-edge-antimagic graceful graph is a super edge magic graceful graph.We study super $(a, d)$-edge-antimagic graceful properties of certain classes of graphs, including complete graphs and complete bipartite graphs.

show abstract

On (Super) Edge-Antimagic Total Labeling of Subdivided Stars

Cited by 2 publications

References 0 publications

Role of Graph Theory to Facilitate Landscape Connectivity: Subdivision of a Harary Graph

Role of Graph Theory to Facilitate Landscape Connectivity: Subdivision of a Harary Graph

Super edge-antimagic graceful labeling of graphs

Contact Info

Product

Resources

About