Submitted:
11 February 2024
Posted:
13 February 2024
You are already at the latest version
Abstract
Keywords:
MSC: 5C17; 05C22; 05E45
1. Scientific Research
References
- Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32-55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition -of-cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf).
- Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32-55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-cancer -and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf).
- Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and-cosuper-hyper-degrees -on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a.pdf).
- Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super Hypergraph by Eulerian Super Hyper Paths and Hamiltonian Sets as Hyper Covering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-and-neutrosophic- super-hypergraph-by-eulerian-super-hyper-Paths-and-hamiltonian-sets-.pdf).
- Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction to Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition and Beyond”, J Math Techniques Comput Math 2(6) (2023) 221-307. (https://www.opastpublishers.com/open-access-articles/neutrosophic-1failed-superhyperforcing-in-the- superhyperfunction-to-use-neutrosophic-superhypergraphs-on-cancers-neutros.pdf).
- Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends Comp Sci Res 2(1) (2023) 16-24. [CrossRef]
- Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. [CrossRef]
- Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear Research. [CrossRef]
- Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European Organization for Nuclear Research. [CrossRef]
- Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023. [CrossRef]
- Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023. [CrossRef]
- Aaron, D. Gray, and Michael A. Henning, “Paired-domination game played on Paths, Discrete Applied Mathematics 336 (2023) 132-146. [CrossRef]
- Walter Carballosa, and Justin Wisby, “Total k-domination in Cartesian product of complete graphs, Discrete Applied Mathematics 337 (2023) 25-41. [CrossRef]
- R. R. Del-Vecchio, and M. Kouider, New bounds for the b-chromatic number of vertex deleted graphs", Discrete Applied Mathematics 306 (2022) 108-113.
- M. E. Elaine et al., Bipartite completion of colored graphs avoiding chordless Paths of given lengths", Discrete Applied Mathematics (2022).
- R. Janczewski et al., Infinite chromatic games", Discrete Applied Mathematics 309 (2022) 138-146.
- L. Li, and X. Li, Edge-disjoint rainbow triangles in edge- colored graphs", Discrete Applied Mathematics 318 (2022) 21-30.
- W. Li et al., Rainbow triangles in arc-colored digraphs", Discrete Applied Mathematics 314 (2022) 169-180.
- Z.Lu,andL.Shi,A sufficient condition for edge-colorable planar graphs with maximum degree 6 ", Discrete Applied Mathematics 313 (2022) 67-70.
- Z. Masih, and M. Zaker, Some comparative results concerning the Grundy and b-chromatic number of graphs", Discrete Applied Mathematics 306 (2022) 1-6.
- F. Wu et al., Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs", Discrete Applied Mathematics 307 (2022) 145-152.














Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
