Review of Domination number and Chromatic number in Turiyam Neutrosophic and Plithogenic Graphs
Takaaki Fujita · Florentin Smarandache
Infinite Study
Ebook
31
Pages
family_home
Eligible
info
reportRatings and reviews aren’t verified Learn More
About this ebook
Graph theory is the study of networks comprising nodes (vertices) and their connections (edges). It is instrumental in analyzing the structure, pathways, and properties of these networks. This paper explores two significant problems in graph theory: the domination number and the chromatic number. The domination number represents the smallest subset of vertices such that every vertex in the graph is either included in this subset or adjacent to at least one vertex within it. The chromatic number, on the other hand, refers to the minimum number of colors needed to color a graph such that no two adjacent vertices share the same color. Additionally, the paper introduces and examines uncertain graph models, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic graphs. It further investigates their respective domination and chromatic numbers, providing insights into these advanced graph concepts.
Rate this ebook
Tell us what you think.
Reading information
Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.
