Edge-Graceful Labelings of Connected Graphs
Copyright policy ) K. Kayathri; R. Amutha;
Edge-Graceful Labelings of Connected Graphs
Abstract Let G be a connected edge-graceful ( p , q ) -graph with q = k p + r , where k is an integer and 0 ≤ r p . In this paper, we prove that every edge-graceful labeling f of G induces [ ( k + 1 ) ! ] r [ k ! ] p − r number of edge-graceful labelings of G.
- Thiagarajar College India
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 1
Average
Average
Average
gold
Beta
Related to Research communities