A Study on Arithmetic Integer Additive Set-Indexers of Graphs
DOI:
https://doi.org/10.26713/jims.v10i1-2.617Keywords:
Integer additive set-indexers, set-indexing number, arithmetic integer additive set-indexers, deterministic index, deterministic ratio.Abstract
Let $\N$ be the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)\to \cP(\N)$ such that the induced function $f^+:E(G) \to \cP(\N)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. A graph $G$ which admits an IASI is called an IASI-graph. An IASI $f$ is said to be a {\em weak IASI} if $|f^+(uv)|=\max(|f(u)|,|f(v)|)$ and an IASI $f$ is said to be a {\em strong IASI} if $|f^+(uv)|=|f(u)|\,|f(v)|$ for all $uv\in E(G)$. In this paper, we introduce the notion of arithmetic integer additive set-indexers of a given graph $G$ as an IASI with respect to which all elements of $G$ have arithmetic progressions as their set-labels and study the characteristics of this type of IASIs.Downloads
References
Acharya B. D., Arithmetic graphs, J. Graph Theory, 14(3)(1990), 275-299.
Acharya B. D., Germina K. A. and Anandavally T. M. K., Some new perspective on arithmetic graphs, in Labeling of Discrete Structures and Applications, (Eds.: B D Acharya, S Arumugam and A Rosa), Narosa
Publishing House, New Delhi, 2008, 41-46.
Apostol T. M., Introduction to analytic number theory, Springer-
Verlag, New York, 1989.
Behzad M., The connectivity of total graphs, Bull. Australian Math. Soc., 1(1969), 175-181.
Bondy J. A. and Murty U. S. R., Graph theory, Springer, 2008.
Brandstadt A., Le V. B. and Spinrad J. P., Graph classes:A survey,
SIAM, Philadelphia, 1999.
Burton D. M., Elementary number theory, Tata McGraw-Hill Inc., New Delhi, 2007.
Gallian J. A., A dynamic survey of graph labeling, Electron. J. Combin., (DS-6), 2014.
Germina K. A. and Anandavally T. M. K., Integer additive set-indexers of a graph: Sum square graphs, J. Combin. Inform. System Sci., 37(2-4)(2012), 345-358.
Germina K. A., Sudev N. K., On weakly uniform integer additive set-indexers of graphs, Int. Math. Forum., 8(37)(2013), 1827-1834. DOI: 10.12988/imf.2013.310188.
Harary F., Graph theory, Addison-Wesley Publishing Company Inc.,1969.
Joshi K. D., Applied discrete structures, New Age International, Delhi, 2003.
Hegde S. M., Numbered graphs and their applications, Ph. D. Thesis, Delhi University, 1989.
Nathanson M. B., Additive number theory: Inverse problems and
geometry of sumsets, Springer, 1996.
Sudev N. K. and Germina K. A., On Integer additive set-indexers of graphs, Int. J. Math. Sci. Engg. Appl., 8(2)(2014), 11-22.
Sudev N. K. and Germina K. A., Some new results on strong integer additive set-indexers of graphs, Discrete Math. Algorithms Appl., 7(1)(2015), 1-11., DOI: 10.1142/S1793830914500657.
Sudev N. K. and Germina K. A., A characterisation of weak integer additive set-indexers of graphs, J. Fuzzy Set Valued Anal., 2014(2014), 1-7., DOI: 10.5899/2014/jfsva-00189.
Trudeau R. J., Introduction to graph theory, Dover Pub., New York,
West D. B., Introduction to graph theory, Pearson Education Inc., 2001.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
