A note on some invariants of bistar

• Authors: K. Murugan , S. Rajeswari , S. Rathnamari
• Languages of publication: EN

Abstracts

EN

Let G = (V,E) be a graph. An open support of a graph G under addition is defined by ∑_(v∈V(G))▒〖supp(v)〗 and it is denoted by supp(G). Similarly an open support of a graph G under multiplication is defined by ∏_(v∈V(G))▒mult⁡〖(v)〗 and it is denoted by mult(G). A closed support G of a graph under addition is defined by 𝑣∈(𝐺) 𝑠𝑢𝑝𝑝[𝑣] and it is denoted by 𝑠𝑢𝑝𝑝[𝐺]. A closed support of a graph G under multiplication is defined by ∏_(v∈V(G))▒mult⁡〖(v)〗 and it is denoted by mult(G). In this article, the authors studied these four invariants of bistar by duplicating all the vertices, duplicating the central edge, duplicating all the vertices by edges, duplicating all the edges by vertices under addition and multiplication.

Keywords

EN

Open support of a graph under addition; Open support of a graph under multiplication; bistar; closed support of graph under addition; closed support of graph under multiplication

Discipline

• INFORMATICS: INFORMATICS

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

Contributors

author

K. Murugan

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

author

S. Rajeswari

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

author

S. Rathnamari

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

References

• [1] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graphsunder Addition I. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5 May (2019) 110-114
• [2] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graphsunder Addition II. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5 May (2019) 115-119
• [3] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graphsunder multiplication. International Journal of Mathematics Trends and Technology, Volume 65, Issue 5, (2019) 134-138
• [4] S. Balamurugan, M. Anitha,C. Karnan, Closed Support of a Graph under Addition. International Journal of Mathematics Trends and Technology, Volume 65, Issues, (May 2019) 120-122
• [5] S. Balamurugan, M. Anitha, C. Karnan, R. Palanikumar, Closed Support of a Graph under Multiplication. International Journal of Mathematics Trends and Technology, Volume 65, Issues, (May 2019),129-133.
• [6] Harary. F, Graph Theory, Addison Wesley, Readiy Massachu setts, VSA 1969.
• [7] M. Jeyalakshmi, N. Meena, Open Support of Some Special Types of Graphs Under Addition, World Scientific News, 156 (2021), 130-146
• [8] N.Meena, A. Subramanian, V. Swaminathan, Strong efficient domination and strong independent saturation number of graphs. International Journal of Mathematics and Soft Computing, Volume 65, No. 2 (2013) 41-48
• [9] K. Monika, K. Murugan, Odd Even Sum Labeling in the Context of Duplication of GraphElements. Mapana Journal of Sciences, Volume 17, No.3 (2018) 17-28
• [10] K. Murugan , S. Rajeswari, Open Support of Path Related Graphs under Addition and Multiplication. World Scientific News 168 (2022) 45-56
• [11] Narasingh, Deo, Graph Theory with Applications to Engineering and Complete Science, Prentice Hall of India, New Delhi, 1990.
• [12] 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

• Document Type: article