2000 character limit reached
Some results of domination and total domination in the direct product of two fuzzy graphs (1312.3444v1)
Published 12 Dec 2013 in cs.DM
Abstract: In this article we give a new definition of direct product of two arbitrary fuzzy graphs. We define the concepts of domination and total domination in this new product graph. We obtain an upper bound for the total domination number of the product fuzzy graph. Further we define the concept of total alpha-domination number and derive a lower bound for the total domination number of the product fuzzy graph in terms of the total alpha-domination number of the component graphs. A lower bound for the domination number of the same has also been found.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.