• Tidak ada hasil yang ditemukan

Anti fuzzy line graphs

N/A
N/A
Protected

Academic year: 2024

Membagikan "Anti fuzzy line graphs"

Copied!
1
0
0

Teks penuh

(1)

Anti fuzzy line graphs ABSTRACT

In crisp graphs, if a graph G is given then we can define line graph L(G) of it. In a similar way, for a given fuzzy graph, we can determine its fuzzy line graph. A number of important results about fuzzy line graphs have been obtained. However, study of anti fuzzy line graphs is still open. Motivated by this, we are interested in studying anti fuzzy line graphs. In this paper, we define the concept of anti fuzzy line graphs. We derive a necessary and sufficient condition for an anti fuzzy graph to be isomorphic to its corresponding anti fuzzy line graph. We investigate when an isomorphism between two anti fuzzy graphs follows from an isomorphism of their corresponding anti fuzzy line graphs. We conjecture a necessary and sufficient condition for an anti fuzzy graph to be the anti fuzzy line graph of some anti fuzzy graph. In particular,we give some result related to regular anti fuzzy line graphs.

Referensi

Dokumen terkait

389.. In this paper we consider the following situation. We give necessary and sufficient conditions for this Leonard pair to be isomorphic to A, A ∗. When working with a Leonard

In this note, we have introduced the notion of Gallai and anti-Gallai total graphs, and have investigated the Eulerian and Hamiltonian properties of these graph operators. Further,

Skripsi ini mempelajari tentang struktur aljabar subgrup multi anti fuzzy dan beberapa sifat terkait. Tujuan skripsi ini adalah menerapakan teori himpunan fuzzy dan teori grup

Pada bagian ini dibahas konsep koset multi-fuzzy dari subgrup normal multi-anti fuzzy pada suatu grup.. Koset multi-fuzzy ini akan digunakan untuk membentuk grup faktor relatif

Pada gambar 3.1 merupakan alur pembuatan “Anti-lock Braking System Pada Krl Commuter Line Jabodetabek Sebagai Penunjang Keselamatan Mengunakan Metode Fuzzy Inference”,

Partic- ularly, strongly regular, edge regular and bi-regular cubic graphs are defined and the necessary and sufficient condition for a cubic graph to be strongly regular is studied..

In this paper, we have proposed an algorithmic approach based on genetic algorithm for finding shortest path from a source node to a destination node in a fuzzy graph with interval