Study on generalisation of triple connected perfect dominating set in fuzzy graph
by T. Gunasekar; K. Elavarasan
International Journal of Engineering Systems Modelling and Simulation (IJESMS), Vol. 14, No. 3, 2023

Abstract: This study presents the idea of k-connected total perfect dominating set in fuzzy graphs in this study. We have generalised connected perfect dominating set to k-connected perfect dominating set. In fuzzy graphs, new concepts are compared with previous ideas. For a few of the important classes, such as cycles and trees, are discussed. The vertex and edge k-connected perfect dominating number of fuzzy graphs are obtained. Maximal fuzzy bipartite part algorithm in fuzzy graph is also described.

Online publication date: Mon, 03-Jul-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Engineering Systems Modelling and Simulation (IJESMS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com