A Study on the Sparing Number of the Corona of Certain Graphs
Let be the set of all non-negative integers and be its the power set. An integer additive set-indexer (IASI) is defined as an injective function such that the induced function defined by is also injective, where is the sum set of and . If , then is said to be a -uniform integer additive set-indexer. An integer additive set-indexer is said to be a weak integer additive set-indexer if . We have some characteristics of the graphs which admit weak integer additive set-indexers. In this paper, we study about the sparing number of the corona of two graphs.
Harary F. Graph Theory. Addison-Wesley Publishing Company Inc. 1994.
Gallian J A. A Dynamic Survey of Graph Labelling. The Electronic Journal of Combinatorics. 2011; (DS 16).
Hammack R, Imrich W, Klavzar S. Handbook of Product Graphs, CRC Press. 2011.
Germina K A, Anandavally T M K . Integer Additive Set-Indexers of a Graph:Sum Square Graphs. Journal of Combinatorics, Information and System Sciences. 2012; 2(4): 345–358p.
Germina K A, Sudev N K. On Weakly Uniform Integer Additive Set-Indexers of Graphs, Int. Math. Forum. 2013; (37): 1827–1834p.
Sudev N K, Germina K A. A Characterisation of Weak Integer Additive Set-Indexers of Graphs. ISPACS J. Fuzzy Set Valued Analysis.
Article Id: JFSVA-0189. 2014: 1–7p.
Sudev N K, Germina K A. Weak Integer Additive Set-Indexers of Graph Operations. Global J. Math. Sciences: Theory and Practical. 2014; (1): 25–36p.
Frucht R, Harary F. On the Corona of Two Graphs. Aequationes Math.1970; (3): 322–325p.
Sudev N K, Germina K A. Weak integer Additive Set-Indexers of Certain Graph Products, (in process of Publication).
West D B (2001). Introduction to graph Theory. Pearson Education. 2001.
- There are currently no refbacks.