Version 1
: Received: 23 December 2022 / Approved: 27 December 2022 / Online: 27 December 2022 (01:56:39 CET)
How to cite:
Garrett, H. SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions. Preprints2022, 2022120500. https://doi.org/10.20944/preprints202212.0500.v1
Garrett, H. SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions. Preprints 2022, 2022120500. https://doi.org/10.20944/preprints202212.0500.v1
Garrett, H. SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions. Preprints2022, 2022120500. https://doi.org/10.20944/preprints202212.0500.v1
APA Style
Garrett, H. (2022). SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions. Preprints. https://doi.org/10.20944/preprints202212.0500.v1
Chicago/Turabian Style
Garrett, H. 2022 "SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions" Preprints. https://doi.org/10.20944/preprints202212.0500.v1
Abstract
The research is on the SuperHyperGirth and the neutrosophic SuperHyperGirth. A SuperHyperGraph has SuperHyperGirth where it’s the longest SuperHyperCycle. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperGirth. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. This SuperHyperClass is officially called “SuperHyperFlower”. If there’s a need to have all SuperHyperCycles until the SuperHyperGirth, then it’s officially called “SuperHyperOrder” but otherwise, it isn’t SuperHyperOrder. There are two instances about the clarifications for the main definition titled “SuperHyperGirth”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperGirth and they’re called “SuperHyperFlower.” A SuperHyperGraph has “neutrosophic SuperHyperGirth” where it’s the strongest [the maximum value from all SuperHyperCycles amid the minimum value amid all SuperHyperEdges from a SuperHyperCycle.] SuperHyperCycle. In “Cancer’s Recognitions”, the aim is to find either the longest SuperHyperCycle or the strongest SuperHyperCycle in those neutrosophic SuperHyperModels. For the longest SuperHyperCycle, called SuperHyperGirth, and the strongest SuperHyperCycle, called neutrosophic SuperHyperGirth, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.
Computer Science and Mathematics, Computer Vision and Graphics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
