PL EN


Preferences help
enabled [disable] Abstract
Number of results
2021 | 156 | 130-146
Article title

Open support of some special types of graphs under addition

Content
Title variants
Languages of publication
EN
Abstracts
EN
A open support of a vertex v under addition is defined by ∑_(u ∈N(v))▒deg⁡〖(u)〗 and it is denoted by supp(v). A open support of a graph under addition is defined by ∑_(v ∈V(G))▒supp⁡〖(v)〗 and it is denoted by supp(G). In this paper, open support of some graphs is studied.
Year
Volume
156
Pages
130-146
Physical description
Contributors
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
author
  • Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli, Tamil Nadu, India
References
  • [1] M. Annapoopathi & N, Meena. Strong Efficient Edge Domination Number of Some Subdivision Graphs. Advances in Mathematics: Scientific Journal, 8, No. 3, 607-616, 2019
  • [2] M. Annapoopathi & N. Meena. Strong Efficient Edge Domination Number of Some Corona Related Graphs. Journal of Emerging Technologies and Innovative Research, Volume 6, Issue 2, 778-787, 2019
  • [3] M. Annapoopathi & N. Meena. Strong Efficient Edge Domination Number of Some Corona Related Graphs. International Journal of Mathematical Trends and Technology, Vol. 59, Number 3, 201-208
  • [4] Aram H., Sheikholeslami, S.M. Favaron, O. Domination subdivision number of trees. Discrete Math. 309, 622–628, 2009
  • [5] R. Balakrishnan, K. Ranganathan. A Textbook of Graph Theory, Springer, 2011.
  • [6] S. Balamurugan, M. Anitha, P. Aristotle, C.Karnan. A Note on Open Support of a Graph Under Addition I, International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, 110-114, 2019
  • [7] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan. A Note on Open Support of a Graph under Addition II. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, 115-119, 2019
  • [8] S. Balamurugan, M. Anitha, C. Karnan. Closed Support of a Graph Under Addition I. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, 115-119, 2019
  • [9] S. Balamurugan, M. Anitha, C. Karnan, P. Palanikumar. Closed Support of a Graph under Addition II. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, 123-128 , 2019
  • [10] Benecke, S., Mynhardt, C.M. Trees with domination subdivision number one. Australas. J. Combin. 42, 201-209, 2008
  • [11] J.A. Bondy, U.S.R. Murthy, Graph theory with Applications, North-Holland, 1982.
  • [12] M. Dettlaff, M. Lemaniskaa, J. Topp. P. Zylinski. Coronas and Domination Subdivision Number of a Graph. Bull. Malays. Math. Sci. Soc. 41: 1717-1724, 2018
  • [13] Favaron, O., Haynes, T.W., Hedetniemi, S.T. Domination subdivision numbers in graphs. Util. Math. 66, 195-209 2004
  • [14] Fei Huang, Shanshan Guo, and Jinjiang Yuan, A Short note on Open Neighbourhood Conflict- Free Colorings of Graphs. SIAM Journal on Discrete Mathematics, Vol. 34, No. 3, 2009-2015, 2020
  • [15] R. Guruviswanathan & V. Swaminathan, Support Strong Dom Chromatic Number in Graphs. International Journal of Pure and Applied Mathematics, Volume 109, No. 9, 150-158, 2016
  • [16] F. Harary. Graph Theory, Addsion Wesley Reading, Mass, (1972).
  • [17] P.P. Kale and N.V. Deshpande. Corrections to the Neighborhood number of a graph. Indian J. Pure Appl. Math. 19(9), 927-929, September, 1985
  • [18] V. R. Kulli and Sigarkanti. Further results on the Neighborhood number of a graph. Indian J. Pure Appl. Math. 23(8); 575-577, August 1992
  • [19] V.Lavanya, D.S.T.Ramesh, & N.Meena, Bidomination in Corono Related Graphs. Journal of Computer and Mathematical Sciences, Vol. 10(11), 1650-1653, November 2019
  • [20] M. Basker, P. Namasivayam, M. P. Syed Ali Nisaya. Some Results on Centered Triangular Sum Graphs. World Scientific News 155 (2021) 113-128
  • [21] K. Murugan, A .Subramanian. Skolem difference mean labeling of H-graphs. International Jurnal of Mathematics and Soft Computing Vol. 1 , No:1, 115-129, 2011
  • [22] K. Murugan and A. Subramanian, Labeling of Subdivided Graphs. American Journal of Mathematics and Sciences Vol. 1, No: 1, 143-149 , 2012
  • [23] M. Prema and K. Murugan, Oblong sum labeling of some graphs. World Scientific News 98 (2018) 12-22
  • [24] K. Murugan. Square Graceful Labeling of Some Graphs. International Journal of Innovative Research in Science, Engineering and Technology, Vol. 4, Issue 2, February 2015
  • [25] S. K. Patel and N. P. Shrimali, Neighborhood-prime labeling. International Journal of Mathematics and Soft Computing, Vol. 5, No. 2 (2015) 135-143
  • [26] S. K. Patel and N. P. Shrimali, Neighborhood-prime labeling of some union graphs. International Journal of Mathematics and Soft Computing, Vol. 6, No. 1 (2016) 39-47
  • [27] R. Sakthi Sankari and M.P. Syed Ali Nisaya, Second order triangular graceful graphs. World Scientific News 155, 140-154, 2021
  • [28] E. Sampathkumar and Prabha S. Neeralagi. The Neighbourhood number of a graph. Indian J. Pure Appl. Math. 16(2), 126-132, February 1985.
  • [29] M. Shikhi and V. Anil Kumar, Common neighbor polynomial of graphs. Far East Journal of Mathematical Sciences, Volume 102, Number 6, 2017, Pages 1201-1221
  • [30] Soner, N. D. and B. Chaluvaraju, The paired-neighborhood number of a graph. Proc. Jangjeon Mathematical Society, South Korea, 8(1), 113-121, 2005
  • [31] Soner, N. D. and B. Chaluvaraju, Maximal edge neighborhood in graphs. Indian Journal of Mathematics 46(2- 3), 283-291, 2004
  • [32] P. Gnanachandra, M. Lellis Thivagar, Separation axioms by virtue of soft semi*-open sets. World Scientific News 145 (2020) 74-84
  • [33] R. Sakthi Sankari and M. P. Syed Ali Nisaya, Seond Order Triangular Gracful Graphs. World Scientific News 155 (2021) 140-154
  • [34] Kostochka, Alexandr, Yager, Derrek, Yu, Gexin 2020. Disjoint Chorded Cycles in Graphs with High Ore-Degree. Discrete Mathematics and Applications Vol. 165, p. 259. https://doi.org/10.1007/978-3-030-55857-4_11
  • [35] Costalonga, J.P., Kingan, Robert J., Kingan, Sandra R. 2021. Constructing Minimally 3-Connected Graphs. Algorithms, Vol. 14, Issue. 1, p. 9. https://doi.org/10.3390/a14010009
  • [36] G. Muthumanickavel, K. Murugan, Oblong Sum Labeling of Union of Some Graphs. World Scientific News 145 (2020) 85-94
  • [37] K. R. Parthasarathy, Basic Graph Theory, Tata Mcgraw Hill Publishing Company Limited, 1994
  • [38] M. Vanu Esakki, M. P. Syed Ali Nisaya, Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
  • [39] M. Vanu Esakki, M. P. Syed Ali Nisaya, Some Results on Two Modulo Three Sum Graphs. Journal of Xidian University, 14(9) (2020) 1090-1099
  • [40] N.Vedavathi, Dharmaiya Gurram, Applications on Graph Theory. International Journal of Engineering Research and Technology, Vol. 2, Issue 1, (2013) 1-4
  • [41] N. Meena, M. Madhan Vignesh. Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News 145 (2020) 234-244
  • [42] Frank Werner.Graph Theoretic Problems and their New Applications. Mathematics, S 445, (2020) 1-4
  • [43] Xiaojing Yang, Junfeng Du, Liming Xiong. Forbidden subgraphs for supereulerian and Hamiltoniangraphs. Discrete Applied Mathematics Volume 288, 15 January 2021, Pages 192-200. https://doi.org/10.1016/j.dam.2020.08.034
  • [44] A. Fathima Banu, S. Chelliah, M. P. Syed Ali Nisaya, Even Vertex Tetrahedral Mean Graphs. World Scientific News 156 (2021) 26-39
  • [45] R. Sakthi Sankari, M. P. Syed Ali Nisaya, Higher order triangular graceful labeling of some graphs. World Scientific News 156 (2021) 40-61
  • [46] M. Baskar, P. Namasivayam, M. P. Syed Ali Nisaya, Further results on centered triangular sum graphs. World Scientific News 156 (2021) 13-25
  • [47] Chiba, Shuya, Yamashita, Tomoki, 2018. Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey. Graphs and Combinatorics, Vol. 34, Issue. 1, p. 1. https://doi.org/10.1007/s00373-017-1873-5
  • [48] Molla, Theodore, Santana, Michael, Yeager, Elyse 2020. Disjoint cycles and chorded cycles in a graph with given minimum degree. Discrete Mathematics, Vol. 343, Issue. 6, p. 111837. https://doi.org/10.1016/j.disc.2020.111837
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-2dfe9ecf-c413-4efa-a917-e7fae3dc050d
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.