INVERSE SIGNED DOMINATING FUNCTIONS OF CORONA AND ROOTED PRODUCT GRAPHS

Main Article Content

shobha Rani C
S. Jeelani Begum
G. S. S. Raju

Abstract

Graph theory is an interesting subject in mathematics. Applications in many fields like Linguistics, Engineering communications, Physical Sciences, coding theory, Computer networking and Logical Algebra. The theory of domination in graphs has a wide range of applications. Among these applications, the most often discussed is a coding theory and communication networks. Inverse Domination theory of graphs which are the important branches of Graph Theory. In this paper, we study the maximal inverse signed dominating functions of corona product graph of a path with a complete graph and rooted product graph of a path with cycle.

Downloads

Download data is not yet available.

Article Details

Section
Articles

References

C. D. Godsil, and B. D. McKay, “A new graph product and its spectrumâ€, Bulletin of the Australian Mathematical Society, 18(01), (1978), 21-28.

C. Lu, S. L. Peng, and C. Tang, “Efficient minus and signed domination in graphsâ€, Algorithms and Computation, (2000), 267-269.

H. U. A. N. G. Zhong-sheng, “On Inverse Signed Total Domination in Graphsâ€, Journal of Langfang Teachers College, (Natural Science Edition), 3, (2010).

J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater, “Signed Domination in Graphs, Graph Theoryâ€, Combinatorics and Application, 1, (1995), 311-322.

O. Favaron, “Signed domination in regular graphsâ€, Discrete Math., 158, (1996), 287-293.

R. Frucht and F. Harary, “On the corona of Two Graphsâ€, Aequationes Mathematicae, 4, (1970), 322 – 325.

Z. Furedi, D. Mubayi, “Signed domination in regular graphs and set systemsâ€, J. Combin. Theory B, 76, (1999), 223-239.