• No results found

Super Edge-antimagic Graceful labeling of Graphs

N/A
N/A
Protected

Academic year: 2020

Share "Super Edge-antimagic Graceful labeling of Graphs"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

Figure

Fig. 1 A ( 0, 1) -super edge-antimagic graceful completegraph.
Figure 2 illustrates the proof of the above theorem.

References

Related documents

In this study, we have shown that in Iran, for con­ secutive patients, it is possible to treat extracranial ca­ rotid atherosclerotic disease with percutaneous balloon

Material and Methods: The species of Salvia fruticosa Mill., Salvia officinalis L., Salvia sclarea L., hybrid ( Salvia fruticosa Mill. were used in the study. Essential

The Floating polymers used in the formulations were HPMC K4M and Locust bean gum (LBG) along with sodium bicarbonate as a low density polymer, gelling agent and gas

Although the advanced age of the abdominal pregnancy (14 – 16 weeks) is not usually treated with a laparoscopic approach, we proved that minimally invasive technique could be a

In the ordinary judgment the court, based in the Albanian procedural law, by its final judgement, may change the legal qualification of the offense for the same criminal fact,

In this paper we consider some particular classes of graphs: paths, caterpillars, cycles, bipartite graphs, complete graphs, planar graphs; for each of these classes, we give

The existence of super (a, d)-H-antimagic labelings for disconnected graphs is studied in [6] and there is proved that if a graph G admits a (super) (a, d)-H- antimagic labeling,

The existence of super a, d-H-antimagic labelings for disconnected graphs is studied in [6] where it is proved that if a graph G admits a super a, d-H-antimagic labeling, where d