Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs by Sukanta Ghadei, Amaresh Chandra Panada, Surapati Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut

“…This research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems. …”
Get full text

Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems by Yuri A. Plaksa, Svetlana A. Kurochkina, Nataliya A. Prusova

Subjects: Get full text

Tadpole Domination in Graphs by Baghdad Science Journal

“…Tadpole domination is calculated for this graph with other families of graphs.…”
Get full text

MixedGraphinFuzzy,Neutrosophic, and Plithogenic Graphs by Florentin Smarandache, Takaaki Fujita

“…In this work, we introduce and analyze the concept of mixed graphs within the contexts of Fuzzy Graphs, Neutrosophic Graphs, and Turiyam Neutrosophic Graphs. …”
Get full text

CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH by Nhu An Do, Quang Tuan Nguyen

“…We determine the condition for G to be a Hamiltonian graph. …”
Get full text

EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH by Thetania Miftakul Zalsa, Diari Indriati, Titin Sri Martini

“…Graph  is a simple, connected, undirected graph with vertex set  and edge set . …”
Get full text

Injective Eccentric Domination in Graphs by Riyaz Ur Rehman A, A Mohamed Ismayil

“…Theorems to determine the exact injective eccentric domination number for the basic class of graphs are stated and proved. Nordhaus-Gaddum results are proposed. …”
Get full text

EDGE IRREGULAR REFLEXIVE LABELING ON MONGOLIAN TENT GRAPH (M_(m,3)) AND DOUBLE QUADRILATERAL SNAKE GRAPH by Diari Indriati, Tsabita Azzahra

“…The minimum value k of the largest label in the graph G is referred to as res (G), which stands for the reflexive edge strength of the graph G. …”
Get full text

Network analysis of the relationship between self-injury addiction, attachment, and anxiety in adolescents with non-suicidal self-injury by Lin Zhao, Shijian Wang, Jingya Li, Linghua Kong, Doudou Zheng, Ying Yang

“…Directed acyclic graph (DAG) analysis further confirmed this relationship, demonstrating that these two key bridging nodes directly influence NSSI addiction. …”
Get full text

Matrix-Network Modeling of Translation Communication from Perspective of Eco-Translatology by I. N. Remkhe

“…The analysis is carried out using two models: a responsibility distribution matrix and an undirected graph compiled using a social network visualizer program as a hypothetical projection of a more complex model, verified in practice. …”
Get full text

Extraction of logical networks during decompiling transistor-level CMOS circuit descriptions by D. I. Cheremisinov, L. D. Cheremisinova

“…In the graph interpretation, the task is reduced to constructing a labeled directed graph of a logical network based on a labeled undirected bipartite graph specifying a two-level description of the transistor circuit.Results. …”
Get full text

Effects of anti-epidemic (quarantine) measures on people during the COVID-19 pandemic: applying social network analysis to identify the key topics by E. K. Pleshkova, Z. I. Rezanova

“…The Social Network Analysis (SNA) method was used to create a keyword co-occurrence network consisting of undirected graphs. This analysis was performed using the free software R version 4.4.1, with the assistance of the Quanteda library, built-in “base” packages, and the gsub function.Results. …”
Get full text

The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods by Omer, Jérémy, Mucherino, Antonio

“…In other words, revorder is a generic problem with several possible extensions corresponding to various real-life applications. Given a simple undirected graph $G=(V,E)$, revorder basically asks whether the vertices of $G$ can be sorted in a way to guarantee that every vertex is adjacent to a minimal number of its predecessors in the order. …”
Get full text