A Study on the Sparing Number of the Corona of Certain Graphs

arXiv1407.5092MaRDI QIDQ6253263FDOQ6253263

Authors: K. P. Chithra, K. A. Germina, N. K. Sudev 

Publication date: 17 July 2014

Abstract: An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)ightarrowmathcalP(mathbb{N}_0)$ such that the induced function $f^{+}:E(G)ightarrowmathcalP(mathbb{N}_0)$ defined by $f^{+}(uv)=f(u)+f(v)$ is also injective, where $f(u)+f(v)$ is the sumset of $f(u)$ and $f(v)$ and $mathcalP(mathbb{N}_0)$ is the power set of $mathbb{N}_0$. If $f^{+}(uv)=kforalluvinE(G)$, then $f$ is said to be a $k$-uniform integer additive set-indexer. An integer additive set-indexer $f$ is said to be a weak integer additive set-indexer if $|f^{+}(uv)|=max(|f(u)|,|f(v)|)foralluvinE(G)$. 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.

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: A Study on the Sparing Number of the Corona of Certain Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6253263)