Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Vertex Domination in t-Norm Fuzzy Graphs

Version 1 : Received: 9 April 2018 / Approved: 10 April 2018 / Online: 10 April 2018 (08:41:33 CEST)
Version 2 : Received: 20 August 2020 / Approved: 22 August 2020 / Online: 22 August 2020 (04:01:45 CEST)

How to cite: Nikfar, M. Vertex Domination in t-Norm Fuzzy Graphs. Preprints 2018, 2018040119. Nikfar, M. Vertex Domination in t-Norm Fuzzy Graphs. Preprints 2018, 2018040119.


For the first time, We do fuzzification the concept of domination in crisp graph on a generalization of fuzzy graph by using membership values of vertices, α-strong edges and edges. In this paper, we introduce the first variation on the domination theme which we call vertex domination. We determine the vertex domination number γv for several classes of t-norm fuzzy graphs which include complete t-norm fuzzy graph, complete bipartite t-norm fuzzy graph, star t-norm fuzzy graph and empty t-norm fuzzy graph. The relationship between effective edges and α-strong edges is obtained. Finally, we discuss about vertex dominating set of a fuzzy tree with respect to a t-norm ⨂ by using the bridges and α-strong edges equivalence.


t-norm Fuzzy graph; t-norm; fuzzy tree; bridge; α-strong edges; vertex domination


Computer Science and Mathematics, Computer Vision and Graphics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.