A Characterisation of Strong Integer Additive Set-Indexers of Graphs

N. K. Sudev; K. A. Germina

doi:10.26713/cma.v5i3.237

Authors

N. K. Sudev Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur 680501
K. A. Germina Department of Mathematics, School of Mathematical & Physical Sciences, Central University of Kerala, Kasaragod

DOI:

https://doi.org/10.26713/cma.v5i3.237

Keywords:

Set-indexer, integer additive set-indexer, strong integer additive set-indexer, difference set, nourishing number of a graph.

Abstract

Let $\mathbb{N}_0$ be the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective, where $f(u)+f(v)$ is the sum set of $f(u)$ and $f(v)$. If $f^+(uv)=k~\forall~uv\in E(G)$, then $f$ is said to be a $k$-uniform IASI. An IASI $f$ is said to be a strong IASI if $|f^+(uv)|=|f(u)|.|f(v)|~\forall ~ uv\in E(G)$. In this paper, we study the characteristics of certain graph classes, graph operations and graph products that admit strong integer additive set-indexers.

4526 261

Downloads

Download data is not yet available.

References

B D Acharya, (1983). Set-Valuations and Their Applications, MRI Lecture notes in Applied Mathematics, The Mehta Research Institute of Mathematics and Mathematical Physics, New Delhi.

R Aharoni, E Berger, M Chudnovsky and J Ziani, Cliques in the Union of Graphs, http://www.columbia.edu/mc2775/edgeunion.pdf

B D Acharya, Set-Indexers of a Graph and Set-Graceful Graphs, Bull. Allahabad Math. Soc., 16(2001), 1-23.

J A Bondy and U S R Murty, Graph Theory, Springer, (2008).

J A Bondy and U S R Murty, (1976). Graph Theory with Applications, North-Holland, New York.

G Chartrand and P Zhang, Introduction to Graph Theory, McGraw-Hill Inc., (2005).

R Diestel, (2000). Graph Theory, Springer-Verlag, New York, (2000).

R Frucht and F Harary (1970). On the Corona of Two Graphs, Aequationes Math., 4(3), 322-325.

J A Gallian, (2011). A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, (DS 16).

K A Germina, Set-Valuations of a Graph and Applications, Final Technical Report, DST Grant-In-Aid Project No.SR/S4/277/05, The Dept. of Science and Technology (DST), Govt. of India, (2011).

K A Germina and T M K Anandavally, (2012). Integer Additive Set-Indexers of a Graph:Sum Square Graphs, Journal of Combinatorics, Information and System Sciences, 37(2-4), 345-358.

K A Germina, N K Sudev, (2013). On Weakly Uniform Set-Indexers of Graphs, Int.Math. Forum, 8(37), 1827-1834.

J. Gross, J. Yellen, Graph Theory and Its Applications, CRC Press, (1999).

R Hammack, W Imrich and S Klavzar (2011). Handbook of Product graphs, CRC Press.

F Harary, Graph Theory, Addison-Wesley Publishing Company Inc., (1969).

W Imrich, S Klavzar, (2000). Product Graphs: Structure and Recognition, Wiley.

K D Joshi, Applied Discrete Structures, New Age International, (2003).

N K Sudev and K A Germina, Some New results on Strong Integer Additive Set-indexers, communicated.

D B West, (2001). Introduction to Graph Theory, Pearson Education Inc.