To see the other types of publications on this topic, follow the link: Complex neutrosophic graph.

Journal articles on the topic 'Complex neutrosophic graph'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Complex neutrosophic graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Siddique, Saba, Uzma Ahmad, Wardat us Salam, Muhammad Akram, and Florentin Smarandache. "Representation of competitions by complex neutrosophic information." Journal of Intelligent & Fuzzy Systems 39, no. 5 (2020): 7881–97. http://dx.doi.org/10.3233/jifs-201338.

Full text
Abstract:
The concept of generalized complex neutrosophic graph of type 1 is an extended approach of generalized neutrosophic graph of type 1. It is an effective model to handle inconsistent information of periodic nature. In this research article, we discuss certain notions, including isomorphism, competition graph, minimal graph and competition number corresponding to generalized complex neutrosophic graphs. Further, we describe these concepts by several examples and present some of their properties. Moreover, we analyze that a competition graph corresponding to a generalized complex neutrosophic grap
APA, Harvard, Vancouver, ISO, and other styles
2

Fujita, Takaaki, and Florentin Smarandache. "Pythagorean, Fermatean, and Complex Turiyam Neutrosophic Graphs." SciNexuses 2 (February 7, 2025): 39–63. https://doi.org/10.61356/j.scin.2025.2486.

Full text
Abstract:
Graph theory examines networks composed of nodes (vertices) and their connections (edges). A graph class is defined by shared structural properties governed by specific rules or constraints. This paper explores uncertain graph models, with a focus on Pythagorean, Fermatean, and Complex Turiyam Neutrosophic Graphs, which extend Neutrosophic Graphs to more effectively address uncertainty. Potential extensions using General Plithogenic Graphs are also discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Alqahtani, Mohammed, M. Kaviyarasu, Anas Al-Masarwah, and M. Rajeshwari. "Application of Complex Neutrosophic Graphs in Hospital Infrastructure Design." Mathematics 12, no. 5 (2024): 719. http://dx.doi.org/10.3390/math12050719.

Full text
Abstract:
Complex neutrosophic graphs are created by combining complex neutrosophic sets with graph theory ideas. This provides a flexible framework for tackling complex problem-solving circumstances. Various processes, such as union, join, and composition, are thoroughly investigated to improve the administration of complicated neutrosophic graphs. This research also looks into the area of complicated neutrosophic graph homeomorphisms, investigating the transformations and mappings that occur inside these structures. This investigation advances our knowledge of the intrinsic features and linkages found
APA, Harvard, Vancouver, ISO, and other styles
4

Narmada Devi, R., N. Kalaivani, S. Broumi, and K. A.Venkatesan. "Characterizations of Strong and Balanced Neutrosophic Complex Graphs." International Journal of Engineering & Technology 7, no. 4.10 (2018): 593. http://dx.doi.org/10.14419/ijet.v7i4.10.21290.

Full text
Abstract:
In this paper, the concepts of neutrosophic complex graph, complete neutrosophic complex graph, strong neutrosophic complex graph, balanced neutrosophic complex graph and strictly balanced neutrosophic complex graph are introduced. Some of the interesting properties and related examples are established.
APA, Harvard, Vancouver, ISO, and other styles
5

Hamidi, Mohammad, and Florentin Smarandache. "Valued-inverse Dombi neutrosophic graph and application." AIMS Mathematics 8, no. 11 (2023): 26614–31. http://dx.doi.org/10.3934/math.20231361.

Full text
Abstract:
<abstract><p>Utilizing two ideas of neutrosophic subsets (NS) and triangular norms, we introduce a new type of graph as valued-inverse Dombi neutrosophic graphs. The valued-inverse Dombi neutrosophic graphs are a generalization of inverse neutrosophic graphs and are dual to Dombi neutrosophic graphs. We present the concepts of (complete) strong valued-inverse Dombi neutrosophic graphs and analyze the complement of (complete) strong valued-inverse Dombi neutrosophic graphs and self-valued complemented valued-inverse Dombi neutrosophic graphs. Since the valued-inverse Dombi neutrosop
APA, Harvard, Vancouver, ISO, and other styles
6

Fujita, Takaaki, and Florentin Smarandache. "Antipodal Turiyam Neutrosophic Graphs." Neutrosophic Optimization and Intelligent Systems 5 (November 17, 2024): 1–13. http://dx.doi.org/10.61356/j.nois.2025.5422.

Full text
Abstract:
Graph theory, a mathematical field, investigates the relationships between entities through vertices and edges [29]. Within this discipline, Uncertain Graph Theory emerges to model uncertainties in realworld networks. This paper presents the concept of the Antipodal Turiyam Neutrosophic Graph. In an Antipodal Graph, two nodes are connected if their shortest path distance equals the graph's diameter, emphasizing connections between the farthest nodes. Turiyam Neutrosophic Graphs extend traditional graphs by introducing four membership values-truth, indeterminacy, falsity, and liberal state-assi
APA, Harvard, Vancouver, ISO, and other styles
7

A., A., and A. Rajkumar. "Neutrosophic Cordial Labeling on Helm and Closed Helm Graph." International Journal of Neutrosophic Science 25, no. 4 (2025): 453–52. https://doi.org/10.54216/ijns.250439.

Full text
Abstract:
The Neutrosophic Cordial Labeling Graph integrates both neutrosophic labeling and Cordial Labeling. Building on our previous work, we have extended our study to include Neutrosophic Cordial Labeling for Helm and Closed Helm Graphs. This extension allows us to explore the application of Neutrosophic Cordial Labeling in more complex graph structures, providing insights into their properties and relationships. One of the key aspects of our research is investigating the relationship between Cordial and Neutrosophic Cordial Labeling. By comparing and contrasting these labeling techniques [4], we ai
APA, Harvard, Vancouver, ISO, and other styles
8

Tola, Keneni Abera, V. N. Srinivasa Rao Repalle, and Mamo Abebe Ashebo. "Theory and Application of Interval-Valued Neutrosophic Line Graphs." Journal of Mathematics 2024 (March 19, 2024): 1–17. http://dx.doi.org/10.1155/2024/5692756.

Full text
Abstract:
Neutrosophic graphs are used to model inconsistent information and imprecise data about any real-life problem. It is regarded as a generalization of intuitionistic fuzzy graphs. Since interval-valued neutrosophic sets are more accurate, compatible, and flexible than single neutrosophic sets, interval-valued neutrosophic graphs (IVNGs) were defined. The interval-valued neutrosophic graph is a fundamental issue in graph theory that has wide applications in the real world. Also, problems may arise when partial ignorance exists in the datasets of membership [0, 1], and then, the concept of IVNG is
APA, Harvard, Vancouver, ISO, and other styles
9

Sasipriya, Sasipriya, and Hemant Kumar. "Energy of Fuzzy, Intuitionistic Fuzzy, and Neutrosophic Graphs in Decision Making-A Literature Review." International Journal of Neutrosophic Science 25, no. 1 (2025): 247–57. http://dx.doi.org/10.54216/ijns.250123.

Full text
Abstract:
This review of the literature delves into the complex interplay between energy measures and decision-making processes in the domains of fuzzy graphs, intuitionistic fuzzy graphs, and neutrosophic graphs. In graph theory, energy is a key quantity that is used to measure structural properties and evaluate decision model dynamics. The research methodically examines the theoretical underpinnings, computational techniques, and practical applications of energy measures in contexts involving decision-making, considering the special features brought forth by fuzzy, intuitionistic fuzzy, and neutrosoph
APA, Harvard, Vancouver, ISO, and other styles
10

Broumi, Said, Swaminathan Mohanaselvi, Tomasz Witczak, Mohamed Talea, Assia Bakali, and Florentin Smarandache. "Complex fermatean neutrosophic graph and application to decision making." Decision Making: Applications in Management and Engineering 6, no. 1 (2023): 474–501. http://dx.doi.org/10.31181/dmame24022023b.

Full text
Abstract:
A new growing area of neutrosophic set (NS) theory called complex neutrosophic sets (CNS) provides useful tools for dealing with uncertainty in complex valued physical variables that are observed in the actual world. A CNS take values for the truth, indeterminacy and falsity membership functions in the complex plane's unit circle. In this research, a novel concept of complex fermatean neutrosophic graph (CFNG) is established. We proposed the order, size, degree and total degree of a vertex of CFNG. Also, we presented the primary operations such as complement, union, join, ring-sum and cartesia
APA, Harvard, Vancouver, ISO, and other styles
11

Fujita, Takaaki, and Florentin Smarandache. "Uncertain Labeling Graphs and Uncertain Graph Classes (with Survey for Various Uncertain Sets)." Plithogenic Logic and Computation 3 (January 13, 2025): 1–74. https://doi.org/10.61356/j.plc.2025.3464.

Full text
Abstract:
Graph theory, a branch of mathematics, studies the relationships between entities using vertices and edges. Uncertain Graph Theory has emerged within this field to model the uncertainties present in real-world networks. Graph labeling involves assigning labels, typically integers, to the vertices or edges of a graph according to specific rules or constraints. This paper introduces the concept of the Turiyam Neutrosophic Labeling Graph, which extends the traditional graph framework by incorporating four membership values—truth, indeterminacy, falsity, and a liberal state—at each vertex and edge
APA, Harvard, Vancouver, ISO, and other styles
12

Bathusha, S. N. Suber, Sowndharya Jayakumar, and S. Angelin Kavitha Raj. "The Energy of Interval-Valued Complex Neutrosophic Graph Structures: Framework, Application and Future Research Directions." Neutrosophic Systems with Applications 13 (January 6, 2024): 67–101. http://dx.doi.org/10.61356/j.nswa.2024.106.

Full text
Abstract:
Graph structure is a developing field with many real-world applications and advancements, particularly effective frameworks for integrative problem-solving in computer networks and artificial intelligence systems. To define the idea of an Interval-Valued Complex Neutrosophic Graph Structure (IVCNGS), the concept of an Interval-Valued Complex Neutrosophic Set (IVCNS) is applied to the graph structure. Using the adjacency matrix to calculate the degree of vertex, we have defined some findings about the IVCNGS. Further, we compute the energy and Laplacian energy of IVCNGS. Moreover, we derive the
APA, Harvard, Vancouver, ISO, and other styles
13

Quek, Shio Gai, Said Broumi, Ganeshsree Selvachandran, Assia Bakali, Mohamed Talea, and Florentin Smarandache. "Some Results on the Graph Theory for Complex Neutrosophic Sets." Symmetry 10, no. 6 (2018): 190. http://dx.doi.org/10.3390/sym10060190.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Srisarkun, V., and C. Jittawiriyanukoon. "An approximation of balanced score in neutrosophic graphs with weak edge weights." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (2021): 5286. http://dx.doi.org/10.11591/ijece.v11i6.pp5286-5291.

Full text
Abstract:
Neutrosophic concept is known undirected graph theory to involve with complex logistic networks, not clearly given and unpredictable real life situations, where fuzzy logic malfunctions to model. The transportation objective is to ship all logistic nodes in the network. The logistic network mostly experiences in stable condition, but for some edges found to be volatile. The weight of these erratic edges may vary at random (bridge-lifting/bascule, ad hoc accident on road, traffic condition) In this article, we propose an approximation algorithm for solving minimum spanning tree (MST) of an undi
APA, Harvard, Vancouver, ISO, and other styles
15

V., Srisarkun, and Jittawiriyanukoon C. "An approximation of balanced score in neutrosophic graphswith weak edge weights." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (2021): 5286–91. https://doi.org/10.11591/ijece.v11i6.pp5286-5291.

Full text
Abstract:
Neutrosophic concept is known undirected graph theory to involve with complex logistic networks, not clearly given and unpredictable real life situations, where fuzzy logic malfunctions to model. The transportation objective is to ship all logistic nodes in the network. The logistic network mostly experiences in stable condition, but for some edges found to be volatile. The weight of these erratic edges may vary at random (bridgelifting/bascule, ad hoc accident on road, traffic condition) In this article, we propose an approximation algorithm for solving minimum spanning tree (MST) of an undir
APA, Harvard, Vancouver, ISO, and other styles
16

Arindam, Arindam, Said Broumi, Ranjan Kumar, and Jayanta Pratihar. "Fermatean Shortest Route Problem with Interval Fermatean Neutrosophic Fuzzy Arc Length: Formulation and a Modified Dijkstra’s Algorithm." International Journal of Neutrosophic Science 23, no. 3 (2024): 288–95. http://dx.doi.org/10.54216/ijns.230323.

Full text
Abstract:
Dijkstra’s algorithm (DA) is a very popular approach for finding the shortest route (SR) in the shortest route problem (SRP). The SRP becomes a challenging and complex problem in real life scenarios. The Fermatean neutrosophic set is a mathematical model that combines Fermatean sets with neutrosophic sets. It can handle the unclear, ambiguous, inconsistent, confusing, and uncertain information that comes from real-world problems. Decision-makers face difficulty accurately determining the precise membership (MG) and non membership levels due to the lack of appropriate data available. The FNS ca
APA, Harvard, Vancouver, ISO, and other styles
17

Kaviyarasu, Murugan, Luminița-Ioana Cotîrlă, Daniel Breaz, Murugesan Rajeshwari, and Eleonora Rapeanu. "A Study on Complex t-Neutrosophic Graph with Intention to Preserve Biodiversity." Symmetry 16, no. 8 (2024): 1033. http://dx.doi.org/10.3390/sym16081033.

Full text
Abstract:
This study introduces the notion of complex t-neutrosophic graphs (CTNGs) as a powerful tool for understanding and displaying complex interactions that are sometimes difficult to understand. It demonstrates that CTNGs may accurately reflect complicated interactions involving several components or dimensions within a particular scenario. It also instructs the basic set operations of CTNGs and analyzes notions like homomorphism and isomorphism within this framework. Furthermore, the research describes a practical application of CTNGs. It illustrates their value in addressing biodiversity conserv
APA, Harvard, Vancouver, ISO, and other styles
18

M.Anandhkumar. "Secondary k-Kernel Symmetric Interval Valued Intuitionistic Neutrosophic Fuzzy Matrices." Communications on Applied Nonlinear Analysis 32, no. 3 (2024): 272–90. http://dx.doi.org/10.52783/cana.v32.1959.

Full text
Abstract:
We propose the idea of secondary symmetric k-kernels with interval-valued intuitionistic neutrosophic fuzzy matrices (IVINFM) like an EP matrix within the complex field. The notion of secondary kernel IVINFM and k-kernel symmetric (KS) IVINFM is presented by providing examples. We also illustrate the graphical representation of KS adjacency IVINFM and incidence IVINFM. We found every isomorphic IVINFM and non-isomorphic IVINFM graph to be k-KS IVINFM. However, the reverse shall not be the case. The definition of k-symmetric IVINFM as k- KS IVINFM, but the reverse is not the case. The character
APA, Harvard, Vancouver, ISO, and other styles
19

Kandasamy, Ilanthenral, Divakar Arumugam, Aryan Rathore, et al. "NCMPy: A Modelling Software for Neutrosophic Cognitive Maps based on Python Package." Neutrosophic Systems with Applications 13 (December 8, 2023): 1–22. http://dx.doi.org/10.61356/j.nswa.2024.114.

Full text
Abstract:
Cognitive maps are a vital tool that can be used for knowledge representation and reasoning. Fuzzy Cognitive Maps (FCMs) are popular soft computing techniques used to model large and complex systems, and they can aid in explainable artificial intelligence (AI). FCMs, however, cannot model the indeterminacy that arises in a system due to various uncertainties. Neutrosophic Cognitive Maps (NCMs), upgraded FCMs that could model indeterminacy, were introduced to address this issue. NCMs are a generalization of FCMs, a field of cognitive science firmly based on neural networks. NCMs have been used
APA, Harvard, Vancouver, ISO, and other styles
20

R., Narmada Devi, N.Kalaivani, Broumi S., and K.A.Venkatesan. "Characterizations of Strong and Balanced Neutrosophic Complex Graphs." May 20, 2019. https://doi.org/10.5281/zenodo.3049625.

Full text
Abstract:
In this paper, the concepts of neutrosophic complex graph, complete neutrosophic complex graph, strong neutrosophic complex graph, balanced neutrosophic complex graph and strictly balanced neutrosophic complex graph are introduced. Some of the interesting properties and related examples are established.
APA, Harvard, Vancouver, ISO, and other styles
21

Shio, Gai Quek, Said Broumi, Selvachandran Ganeshsree, Bakali Assia, Talea Mohamed, and Smarandache Florentin. "Some Results on the Graph Theory for Complex Neutrosophic Sets." May 16, 2019. https://doi.org/10.5281/zenodo.2864554.

Full text
Abstract:
Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graphs called complex neutrosophic graphs of type 1 (abbr. CNG1).
APA, Harvard, Vancouver, ISO, and other styles
22

Shio, Gai Quek, Broumi Said, Selvachandran Ganeshsree, Bakali Assia, Talea Mohamed, and Smarandache Florentin. "Some Results on the Graph Theory for Complex Neutrosophic Sets." September 7, 2018. https://doi.org/10.5281/zenodo.1411270.

Full text
Abstract:
Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graphs called complex neutrosophic graphs of type 1 (abbr. CNG1). We then present a matrix representation for it and study some properties of this new concept. The concept of CNG1 is an extension of the generalized fuzzy graphs of type 1 (GFG1) and generalized single-valued neutrosophic graphs of type 1 (GSVNG1). The utility of the CNG1 introduced here are applied to a multi-attribute decision making problem relat
APA, Harvard, Vancouver, ISO, and other styles
23

Said, Broumi, Bakali Assia, Talea Mohamed, and Smarandache Florentin. "Complex Neutrosophic Graphs of Type 1." August 8, 2017. https://doi.org/10.5281/zenodo.888841.

Full text
Abstract:
In this paper, we introduced a new neutrosophic graphs called complex neutrosophic graphs of type1 (CNG1) and presented a matrix representation for it and studied some properties of this new concept. The concept of CNG1 is an extension of generalized fuzzy graphs of type 1 (GFG1) and generalized single valued neutrosophic graphs of type 1 (GSVNG1).
APA, Harvard, Vancouver, ISO, and other styles
24

Meenakshi, A., O. Mythreyi, M. Bramila, A. Kannan, and J. Senbagamalar. "Application of neutrosophic optimal network using operations." Journal of Intelligent & Fuzzy Systems, February 21, 2023, 1–13. http://dx.doi.org/10.3233/jifs-223718.

Full text
Abstract:
Neutrosophic graphs deals with more complex, uncertain problems in real-life applications which provides more flexibility and compatibility than Intuitionistic fuzzy graphs. The aim of this paper is to enrich the efficiency of the network in accordance with productivity and quality. Here we develop two Neutrosophic graphs into a fully connected Neutrosophic network using the product of graphs. Such a type of network is formed from individuals with unique aspects in every field of work among them. This study proposes extending the other graph products and forming a single valued Neutrosophic gr
APA, Harvard, Vancouver, ISO, and other styles
25

Said, Broumi, Bakali Assia, Talea Mohamed, Smarandache Florentin, and Venkateswara Rao V. "Bipolar Complex Neutrosophic Graphs of Type 1." April 30, 2018. https://doi.org/10.5281/zenodo.1237869.

Full text
Abstract:
In this paper, we introduced a new neutrosophic graphs called bipolar complex neutrosophic graphs of type1 (BCNG1) and presented a matrix representation for it and studied some properties of this new concept.
APA, Harvard, Vancouver, ISO, and other styles
26

Meenakshi, A., and O. Mythreyi. "Applications of Neutrosophic social network using max product networks." Journal of Intelligent & Fuzzy Systems, March 6, 2023, 1–14. http://dx.doi.org/10.3233/jifs-223484.

Full text
Abstract:
Neutrosophic graphs deals with more complex, uncertain problems in real-life applications which provides more flexibility and compatibility than intuitionistic fuzzy graphs. The aim of this paper is to enrich the efficiency of the maximized network in accordance with time management and quality. Here we maximize three neutrosophic graphs into a fully connected Neutrosophic network using the Max product of graphs. Such a type of network is formed from individuals with unique aspects in every field of work among them. This study proposes the max product of three graphs and forming a single-value
APA, Harvard, Vancouver, ISO, and other styles
27

Said, Broumi, Bakali Assia, Talea Mohamed, Smarandache Florentin, Dey Arindam, and Hoang Son Le. "Spanning Tree Problem with Neutrosophic Edge Weights." September 7, 2018. https://doi.org/10.5281/zenodo.1411292.

Full text
Abstract:
Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finall
APA, Harvard, Vancouver, ISO, and other styles
28

Çakır, Esra, Ziya Ulukan, and Tankut Acarman. "Time-dependent Dijkstra’s algorithm under bipolar neutrosophic fuzzy environment." Journal of Intelligent & Fuzzy Systems, July 7, 2021, 1–10. http://dx.doi.org/10.3233/jifs-219188.

Full text
Abstract:
Determining the shortest path and calculating the shortest travel time of a complex networks are important for transportation problems. Numerous approaches has been developed to search shortest path on graphs, and one of the well-known is the Dijkstra’s label correcting algorithm. Dijkstra’s approach is capable of determining shortest path of directed or undirected graph with non-negative weighted arcs. To handle with uncertainty in real-life, the Dijkstra’s algorithm should be adapted to fuzzy environment. The weight of arc -which is the vague travel time between two nodes- can be expressed i
APA, Harvard, Vancouver, ISO, and other styles
29

Garrett, Henry. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Multipartite and Cycle By Burning Number From Graph Searching." July 27, 2024. https://doi.org/10.5281/zenodo.13091499.

Full text
Abstract:
358 [HG358] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Multipartite and Cycle By Burning Number From Graph Searching”, Zenodo 2024, (doi: 10.5281/zenodo.13091499). @ResearchGate: https://www.researchgate.net/publication/-@Scribd: https://www.scribd.com/document/-@ZENODO_ORG: https://zenodo.org/record/13091499@academia: https://www.academia.edu/-   \section{SYNOPSIS}In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyper{\tiny Burning Number}). Let a Neutrosophic SuperHyperGraph (NSHG) $S$ be a pair $S=
APA, Harvard, Vancouver, ISO, and other styles
30

Garrett, Henry. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Bipartite and Path By Burning Number From Graph Searching." July 30, 2024. https://doi.org/10.5281/zenodo.13134329.

Full text
Abstract:
359 [HG359] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Bipartite and Path By Burning Number From Graph Searching”, Zenodo 2024, (doi: 10.5281/zenodo.13134329). @ResearchGate: https://www.researchgate.net/publication/382660664@Scribd: https://www.scribd.com/document/-@ZENODO_ORG: https://zenodo.org/records/13134329@academia: https://www.academia.edu/- \section{SYNOPSIS}In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyper{\tiny Burning Number}). Let a Neutrosophic SuperHyperGraph (NSHG) $S$ be a pair $S=(V
APA, Harvard, Vancouver, ISO, and other styles
31

Garrett, Henry. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Star and Wheel By Burning Number From Graph Searching." August 5, 2024. https://doi.org/10.5281/zenodo.13218489.

Full text
Abstract:
360 [HG360] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Star and Wheel By Burning Number From Graph Searching”, Zenodo 2024, (doi: 10.5281/zenodo.13218489). @ResearchGate: https://www.researchgate.net/publication/-@Scribd: https://www.scribd.com/document/-@ZENODO_ORG: https://zenodo.org/record/13218489@academia: https://www.academia.edu/-   \section{SYNOPSIS}In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyper{\tiny Strongly Burning Number}). Let a Neutrosophic SuperHyperGraph (NSHG) $S$ be a pair $S
APA, Harvard, Vancouver, ISO, and other styles
32

Garrett, Henry. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Star and Wheel By Zero Forcing From Graph Searching." July 20, 2024. https://doi.org/10.5281/zenodo.12788786.

Full text
Abstract:
357 [HG357] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Star and Wheel By Zero Forcing From Graph Searching”, Zenodo 2024, (doi: 10.5281/zenodo.12788786). @ResearchGate: https://www.researchgate.net/publication/-@Scribd: https://www.scribd.com/document/-@ZENODO_ORG: https://zenodo.org/record/12788786@academia: https://www.academia.edu/- \section{SYNOPSIS}In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyper{\tiny Strongly Zero Forcing}). Let a Neutrosophic SuperHyperGraph (NSHG) $S$ be a pair $S=(V,E).$ Co
APA, Harvard, Vancouver, ISO, and other styles
33

Henry, Garrett. "Failed SuperHyperStable." January 4, 2023. https://doi.org/10.5281/zenodo.7504782.

Full text
Abstract:
\chapter{Abstract}  \linenumbers In this research book, there are two research chapters ``Extreme Failed SuperHyperStable'' and ``Neutrosophic Failed SuperHyperStable'' about some researches on Extreme Failed SuperHyperStable and neutrosophic Failed SuperHyperStable. With researches on the basic properties, the research book starts to make Extreme Failed SuperHyperStable theory and neutrosophic Failed SuperHyperStable theory more understandable. \\ \\ In the first chapter, in this research, new setting is introduced for new SuperHyperNotions, namely, a Failed SuperHyperSta
APA, Harvard, Vancouver, ISO, and other styles
34

"Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction to Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition and Beyond." Journal of Mathematical Techniques and Computational Mathematics 2, no. 6 (2023): 221–307. http://dx.doi.org/10.33140/jmtcm.02.06.04.

Full text
Abstract:
In this research, new setting is introduced for new SuperHyperNotion, namely, Neutrosophic 1-failed SuperHyperForcing. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions ar
APA, Harvard, Vancouver, ISO, and other styles
35

Gholami, Maryam, Amir Sheikhahmadi, Keyhan Khamforoosh, Mahdi Jalili, and Farshid Veisi. "A new approach to finding overlapping community structure in signed networks based on Neutrosophic theory." Journal of Complex Networks 12, no. 1 (2023). http://dx.doi.org/10.1093/comnet/cnad051.

Full text
Abstract:
Abstract One of the longstanding challenges in network science is the identification of overlapping community structures. Real-world networks often exhibit a complex interplay of positive and negative relationships, making the recognition of overlapping communities a crucial area of research. Current community detection methods in signed networks primarily focus on discovering disjoint communities, where each node belongs exclusively to a single community. However, these algorithms often fail to detect overlapping communities, where nodes can belong to multiple communities simultaneously. To a
APA, Harvard, Vancouver, ISO, and other styles
36

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure." March 7, 2023. https://doi.org/10.13140/RG.2.2.35105.89447.

Full text
Abstract:
“#180 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35105.89447). @ResearchGate: https://www.researchgate.net/publication/369051049 @Scribd: https://www.scribd.com/document/- @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/-   -- \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsf
APA, Harvard, Vancouver, ISO, and other styles
37

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves." March 2, 2023. https://doi.org/10.13140/RG.2.2.22011.80165.

Full text
Abstract:
“#174 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). @ResearchGate: https://www.researchgate.net/publication/368922546 @Scribd: https://www.scribd.com/document/628952478 @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/-   \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsth
APA, Harvard, Vancouver, ISO, and other styles
38

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Chord As Hyper Excellence On Super Excess." March 5, 2023. https://doi.org/10.13140/RG.2.2.13059.58401.

Full text
Abstract:
“#176 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13059.58401). @ResearchGate: https://www.researchgate.net/publication/369019923 @Scribd: https://www.scribd.com/document/629520682 @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/-   \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts,
APA, Harvard, Vancouver, ISO, and other styles
39

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns." March 6, 2023. https://doi.org/10.13140/RG.2.2.31147.52003.

Full text
Abstract:
“#178 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31147.52003). @ResearchGate: https://www.researchgate.net/publication/369029627 @Scribd: https://www.scribd.com/document/- @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/-   \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfont
APA, Harvard, Vancouver, ISO, and other styles
40

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection." February 26, 2023. https://doi.org/10.13140/RG.2.2.10493.84962.

Full text
Abstract:
“#172 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). @ResearchGate: https://www.researchgate.net/publication/368824400     \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, tikz, color} \usepackage[bookmarksnumbered, colorlinks, plainpages]{hyperref} %
APA, Harvard, Vancouver, ISO, and other styles
41

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super Patterns." February 24, 2023. https://doi.org/10.13140/RG.2.2.19944.14086.

Full text
Abstract:
“#170 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). @ResearchGate: https://www.researchgate.net/publication/368781100 @Scribd: https://www.scribd.com/document/- @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/-       \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, a
APA, Harvard, Vancouver, ISO, and other styles
42

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super Distances." February 20, 2023. https://doi.org/10.13140/RG.2.2.31956.88961.

Full text
Abstract:
“#161 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). @ResearchGate: https://www.researchgate.net/publication/368663284 @Scribd: https://www.scribd.com/document/626941521 @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/97244153       \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \use
APA, Harvard, Vancouver, ISO, and other styles
43

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super Neighbors." February 21, 2023. https://doi.org/10.13140/RG.2.2.13973.81121.

Full text
Abstract:
“#164 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). @ResearchGate: https://www.researchgate.net/publication/368686241 @Scribd: https://www.scribd.com/document/627159268     \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, tikz, color} \usepackage[bookmarksnum
APA, Harvard, Vancouver, ISO, and other styles
44

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super Landmarks." February 22, 2023. https://doi.org/10.13140/RG.2.2.35646.56641.

Full text
Abstract:
“#166 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). @ResearchGate: https://www.researchgate.net/publication/368717242 @Scribd: https://www.scribd.com/document/627431073   \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, tikz, color} \usepackage[bookmarksnumbered, c
APA, Harvard, Vancouver, ISO, and other styles
45

Garrett, Henry. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Multipartite and Cycle By STRONGLY-DOMINATING SET." December 22, 2024. https://doi.org/10.5281/zenodo.14543895.

Full text
Abstract:
388 [HG388] Henry Garrett, "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Multipartite and Cycle By STRONGLY-DOMINATING SET", Zenodo 2024, (doi: 10.5281/zenodo.14543895). @ResearchGate: https://www.researchgate.net/publication/387313984 @Scribd: https://www.scribd.com/document/807475988 @ZENODO_ORG: https://zenodo.org/record/14543895 @academia: https://www.academia.edu/126500618 Dr. Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA \section{SYNOPSIS}In this scientific researc
APA, Harvard, Vancouver, ISO, and other styles
46

Garrett, Henry. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Bipartite and Path By STRONGLY-DOMINATING SET." December 23, 2024. https://doi.org/10.5281/zenodo.14547873.

Full text
Abstract:
389 [HG389] Henry Garrett, "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Bipartite and Path By STRONGLY-DOMINATING SET", Zenodo 2024, (doi: 10.5281/zenodo.14547873). @ResearchGate: https://www.researchgate.net/publication/387334556 @Scribd: https://www.scribd.com/document/807783894 @ZENODO_ORG: https://zenodo.org/record/14547873 @academia: https://www.academia.edu/126521962   Dr. Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA \section{SYNOPSIS}In this scientific rese
APA, Harvard, Vancouver, ISO, and other styles
47

Dr., Henry Garrett. "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Bipartite and Path By TOTAL DOMINATION I." January 19, 2025. https://doi.org/10.5281/zenodo.14692541.

Full text
Abstract:
416 [HG416] Henry Garrett, "New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With Bipartite and Path By TOTAL DOMINATION I", ResearchGate 2025, (doi: 10.13140/RG.2.2.34901.33760). @ResearchGate: https://www.researchgate.net/publication/388177563 @Scribd: https://www.scribd.com/document/817652286 @ZENODO_ORG: https://zenodo.org/record/14692541 @academia: https://www.academia.edu/127130143 Dr. Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA   \section{SYNOPSIS}In this scientific
APA, Harvard, Vancouver, ISO, and other styles
48

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super Layers." February 23, 2023. https://doi.org/10.13140/RG.2.2.33103.76968.

Full text
Abstract:
“#168 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). @ResearchGate: https://www.researchgate.net/publication/368752952   \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, tikz, color} \usepackage[bookmarksnumbered, colorlinks, plainpages]{hyperref} % use Unicode chara
APA, Harvard, Vancouver, ISO, and other styles
49

Henry, Garrett. "New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Space As Hyper Sparse On Super Spark." March 8, 2023. https://doi.org/10.13140/RG.2.2.21756.21129.

Full text
Abstract:
“#184 Article” Henry Garrett, “New Ideas In Cancer's Recognition And Neutrosophic SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21756.21129). @ResearchGate: https://www.researchgate.net/publication/369086888 @Scribd: https://www.scribd.com/document/- @ZENODO_ORG: https://zenodo.org/record/- @academia: https://www.academia.edu/-   \documentclass[10pt,letterpaper]{article} \usepackage[top=0.85in,left=2.79in,footskip=0.79in,marginparwidth=2in]{geometry} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, grap
APA, Harvard, Vancouver, ISO, and other styles
50

"Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs and Super Hyper Graphs Alongside Applications in Cancer’s Treatments." Journal of Mathematical Techniques and Computational Mathematics 2, no. 1 (2023). http://dx.doi.org/10.33140/jmtcm.02.01.05.

Full text
Abstract:
In this research, new setting is introduced for new notions, namely, Super Hyper Degree and Co-Super Hyper Degree. Two different types of definitions are debut for them but the research goes further and the Super Hyper Notion, Super Hyper Uniform, and Super Hyper Class based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this Super Hyper Notion with other Super Hyper Notions and fundamental Super Hyper Numbers are featured. The definitions are
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!