CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

On the Sparing Number of the Edge-Corona of Graphs

by K. P. Chithra, K. A. Germina, N. K. Sudev
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 118 - Number 1
Year of Publication: 2015
Authors: K. P. Chithra, K. A. Germina, N. K. Sudev
10.5120/20706-3025

K. P. Chithra, K. A. Germina, N. K. Sudev . On the Sparing Number of the Edge-Corona of Graphs. International Journal of Computer Applications. 118, 1 ( May 2015), 1-5. DOI=10.5120/20706-3025

@article{ 10.5120/20706-3025,
author = { K. P. Chithra, K. A. Germina, N. K. Sudev },
title = { On the Sparing Number of the Edge-Corona of Graphs },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 118 },
number = { 1 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume118/number1/20706-3025/ },
doi = { 10.5120/20706-3025 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:02:47.342145+05:30
%A K. P. Chithra
%A K. A. Germina
%A N. K. Sudev
%T On the Sparing Number of the Edge-Corona of Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 118
%N 1
%P 1-5
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Let N0 be the set of all non-negative integers and P(N0) be its the power set. An integer additive set-indexer (IASI) of a graph G is an injective function f : V (G) ! P(N0) such that the induced function f+ : E(G) ! P(N0) 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). An integer additive set-indexer f is said to be a weak integer additive set-indexer (weak IASI) if jf+(uv)j = max(jf(u)j; jf(v)j) 8 uv 2 E(G). The minimum number of singleton set-labeled edges required for the graph G to admit a weak IASI is called the sparing number of the graph. In this paper, we discuss the admissibility of weak IASI by a particular type of graph product called the edge corona of two given graphs and determine the sparing number of the edge corona of certain graphs.

References
  1. J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, 2008.
  2. K. P. Chithra, K. A. Germina and N. K. Sudev, The Sparing Number of the Cartesian product of Certain Graphs, Communications in Mathematics & Applications, 5(1)(2014), 23-30.
  3. K. P. Chithra, K. A. Germina and N. K. Sudev, A Study on the Sparing Number of the Corona of Certain Graphs, Research & Reviews: Discrete Mathematical Structures, 1(2)(2014), 5- 15.
  4. R. Frucht and F. Harary, On the Corona of Two Graphs, Aequationes Math. , 4(3)(1970), 322-325.
  5. J. A. Gallian, A Dynamic Survey of Graph Labelling, The Electronic Journal of Combinatorics, # DS 16, 2013.
  6. K. A. Germina and T. M. K. Anandavally, Integer Additive Set-Indexers of a Graph:Sum Square Graphs, Journal of Combinatorics, Information and System Sciences, 37(2- 4)(2012), 345-358.
  7. K. A. Germina and N K Sudev, On Weakly Uniform Integer Additive Set-Indexers of Graphs, International Mathematical Forum, 8(37)(2013), 1827-1834.
  8. R. Hammack,W. Imrich and S. Klavzar, Handbook of Product graphs, CRC Press, 2011.
  9. F. Harary, Graph Theory, Addison-Wesley Publishing Company Inc. , 1994.
  10. Y. Hu and W. C. Shiu, The spectrum of the edge corona of two graphs, Electronic Journal of Linear Algebra, 20(2010), 586-594.
  11. N. K. Sudev and K. A. Germina, A Characterisation of Weak Integer Additive Set-Indexers of Graphs, Journal of Fuzzy Set Valued Analysis, 2014(2014), Article Id: jfsva-0189, 7 pages.
  12. N. K. Sudev and K. A. Germina, Weak Integer Additive Set- Indexers of Graph Operations, Global Journal of Mathematical Sciences: Theory and Practical, 6(1)(2014),25-36.
  13. N. K. Sudev and K. A. Germina, Further Studies on the Sparing Number of Graphs, TechS Vidya e-Journal of Research, 2(2013-14), 28-38.
  14. N. K. Sudev and K. A. Germina, A Note on Sparing Number of Graphs, Advances and Applications in Discrete Mathematics, 14(1)(2014), 51-65.
  15. N. K. Sudev and K. A. Germina, On Weak Integer Additive Set-Indexers of Certain Graph Classes, Journal of Discrete Mathematical Sciences and Cryptography, to appear.
  16. N. K. Sudev and K. A. Germina, Weak integer Additive Set- Indexers of Certain Graph Products, Journal of Informatics and Mathematical Sciences, 6(1)(2014), 35-43.
  17. D BWest, (2001). Introduction to Graph Theory, Pearson Education Inc.
Index Terms

Computer Science
Information Sciences

Keywords

Integer additive set-indexers mono-indexed elements of a graphs weak integer additive set-indexers sparing number of a graph edge corona of a graph

Powered by PhDFocusTM