Open and closed support of some star related graphs under addition and multiplication

• Authors: N. Meena , P. Pavithra , R. Poornima
• Languages of publication: EN

Abstracts

EN

Let G be a simple graph. supp(v) is defined by ∑_(u∈N(v))▒deg⁡u . supp(G) is defined by ∑_(v∈V(G))▒supp(v) . supp[v] is defined by ∑_(u∈N[v])▒deg⁡u . Supp[G] is defined by ∑_(v∈V[G])▒supp⁡[v] . mult(v) is defined by ∏_(u∈N(v))▒deg⁡u . and mult(G) is defined by ∏_(v∈V(G))▒mult⁡(v) .mult [v] is defined by ∏_(u∈N[v])▒deg⁡u . mult [G] is defined by. ∏_(v∈V[G])▒mult⁡[v] In this paper, open and closed support of some of star related graphs under addition and multiplication are studied.

Keywords

EN

Duplicating of a vertex by an edge; Duplication of a vertex; Duplication of an edge; Duplication of an edge by a vertex; Open support of a graph under addition; Open support of a graph under multiplication; closed support of a graph under addition; closed support of a graph under multiplication

Discipline

• INFORMATICS: INFORMATICS

• Publisher: Scientific Publishing House „DARWIN”
• Journal: World Scientific News
• Year: 2022
• Volume: 168
• Pages: 132-146

Contributors

author

N. Meena

• Post Graduate and Research Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli – 627010, Tamil Nadu, India

author

P. Pavithra

• Post Graduate and Research Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli – 627010, Tamil Nadu, India

author

R. Poornima

• Post Graduate and Research Department of Mathematics, The Madurai Diraviyam Thayumanavar Hindu College, Tirunelveli – 627010, Tamil Nadu, India

References

• [1] M. Annapoopathi, N. Meena, Strong efficient edge domination number of some graphs obtained by duplicating their Elements. International Journal of Modern Agriculture 9(4), (2020) 679-688
• [2] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graphs under Addition I. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5 May (2019) 110-114
• [3] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graphs under Addition II , International Journal of Mathematics Trends and Technology, Volume 65, Issue 5 May (2019) 115-119
• [4] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graphs under Multiplication. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5 (2019) 134-138
• [5] S. Balamurugan, M. Anitha and C. Karnan, Closed Support of a Graph under Addition International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, (May 2019) 120-122
• [6] S. Balamurugan, M. Anitha, C. Karnan, R. Palanikumar, Closed Support of a Graph under Multiplication. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, (May 2019) 129-133.
• [7] J.C. Berbond, Graceful Graphs, Radio Antennae and French Wind Mills, Graph Theory and Combinatories, Pitman, London, (1979) 13-17
• [8] G.S. Bloom and S.W. Golomb, Applications of Numbered Undirected Graphs. Proceedings of IEEE, Vol. 65, No. 4 (1977) 562-570
• [9] Bloom G.S and Golomb S.W, Numbered Complete Graphs, Unusual Rules and Assoorted Applications, Theory and Application of Graphs, Lecture Notes in Math 642, Springer-Verlag, (1978) 53-65
• [10] Chiba, Shuya, Yamashita, Tomoki 2018, Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey. Graphs and Combinatorics, Volume 34, Issue. 1, p. 1
• [11] Costalonga, J. P., Kingan, Robert J., Kingan, Sandra R. 2021. Constructing Minimally 3-Connected Graphs. Algorithms, Vol. 14, Issue. 1, p. 9.
• [12] Frank Werner, Graph-Theoretic Problems and Their New Applications. Mathematics, 8, 445 (2020) 1-4
• [13] D. Gunasekaran, K. Senbagam, R. Saranya, Labeling of 2-regular graphs by even edge magic. World Scientific News, 135 (2019) 32-47
• [14] Harary. F, Graph Theory, Addison Wesley. Readiy Massachu setts, VSA 1969.
• [15] M. Jeyalakshmi, N. Meena, Open Support of Some Special Types of Graphs Under Addition. World Scientific News, 156 (2021) 130-146
• [16] Kostochka, A., Yager, D., Yu, G. (2020). Disjoint Chorded Cycles in Graphs with High Ore-Degree. In: Raigorodskii, A.M., Rassias, M.T. (eds) Discrete Mathematics and Applications. Springer Optimization and Its Applications, vol 165. Springer, Cham. https://doi.org/10.1007/978-3-030-55857-4_11
• [17] N. Meena, M. Madhan Vignesh, Strong Efficient Co-Bondage Number of Some Graphs. World Scientific News, 145 (2020) 234-244
• [18] 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
• [19] K. Monika, K. Murugan Odd-even sum Labeling in the context of graph elements. Mapana Journal of Sciences Volume 17, No. 3 (2018) 17-28
• [20] Muhammed Imran, Adnan Aslam, Sohail Zafar and Waqar Nazeer, Further Results on Edge Irregularity Strength of Graphs, Indonesian Journal of Combinnatorics 1(2), (2017) 82-97
• [21] K. Murugan, Square graceful labeling of some graphs. International Journal of Innovative Research in Science Engineering and Technology, Vol. 4, Issue 2, February (2015) 511-520.
• [22] G. Muthumanickavel, K. Murugan, Oblong Sum Labeling of Union of Some Graphs. World Scientific News, 145 (2020) 85-94
• [23] Narasingh, Deo, Graph Theory with Applications to Engineering and Complete Science, Prentice Hall of India, New Delhi, 1990.
• [24] R.Sivaraman, Graceful Graphs and its Applications. International Journal of Current Research, Vol. 8, Issue 11, (November 2016), 41062-41067
• [25] K. Thiagarajan, A. Veeraiah, Basic study with Support and Support Value of Connected Network Graph Support Study for Special Graph. International Journal of Innovative Technology and Exploring Engineering Volume 8, Issue 7, May (2019), 1084-1086
• [26] S.K. Vaidhya and N.A. Dani, Cordial and 3 Equitable Graphs induced by Duplication of Edge. Mathematics Today 27, 71-82, 2013
• [27] M. Vanu Esakki, M. P. Syed Ali Nisaya, Two Modulo Three Sum Graphs. World Scientific News 145 (2020) 274-285
• [28] Xiaojing Yang, Junfeng Du, Liming Xiong, Forbidden subgraphs for supereulerian and Hamiltonian graphs. Discrete Applied Mathematics Volume 288, 15 January 2021, Pages 192-200

• Document Type: article