inner-banner-bg

Journal of Mathematical Techniques and Computational Mathematics(JMTCM)

ISSN: 2834-7706 | DOI: 10.33140/JMTCM

Impact Factor: 1.3

Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes

Abstract

Henry Garrett

In this research article, the notions of Super Hyper Dominating and Super Hyper Resolving are defined in the setting of neutrosophic Super Hyper Graphs. Some ideas are introduced on both notions of Super Hyper Dominating and Super Hyper Resolving, simultaneously and as the same with each other. Some neutrosophic Super Hyper Classes are defined based on the notion, Super Hyper Resolving. The terms of duality, totality, perfectness, connectedness, and stable, are added to basic framework and initial notions, Super Hyper Dominating and Super Hyper Resolving but the concentration is on the “perfectness” to figure out what’s going on when for all targeted Super Hyper Vertices, there’s only one Super Hyper Vertex in the intended set. There are some instances and some clarifications to make sense about what’s happened and what’s done in the starting definitions. The key point is about the minimum sets. There are some questions and some problems to be taken as some avenues to pursue this study and this research. A basic familiarity with Super Hyper Graph theory and neutrosophic Super Hyper Graph theory is proposed.

PDF