Food safety risk analysis utilising <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"> <mml:mi mathvariant="script">K</mml:mi> </mml:math> -lexicographic-max product of neutrosophic graph

In this study, we introduce the concept of the K-Lexicographic Max Product (K−LMP) of neutrosophic graphs and explore its associated degree structure to enhance decision-making frameworks in food safety applications related to risk assessment, including freshness, contamination, and spoilage. Neutrosophic graphs, capable of handling indeterminacy, inconsistency, and incompleteness, provide a flexible mathematical foundation for modelling complex systems. By incorporating the K−LMP into neutrosophic graphs, we offer a novel approach to comparing and ranking food safety scenarios where multiple attributes and uncertain information coexist. We present example graphs and theorems related to K−LMP and further define the K-Lexicographic degree to quantify node significance within the context of neutrosophic graphs. To validate the practical utility of this approach, a food safety analysis is implemented, demonstrating how the model identifies critical control points and supports more robust, transparent decision-making under uncertainty. This work contributes to the advancement of neutrosophic graph theory and its interdisciplinary application in food quality and safety management.

Authors

Publication Details

Journal
Ain Shams Engineering Journal
Published
2025-09-23
DOI
https://doi.org/10.1016/j.asej.2025.103761
Citations
1
Primary Topic
Multi-Criteria Decision Making
Type
article
Field-Weighted Citation Impact
2.11
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Food safety risk analysis utilising <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"> <mml:mi mathvariant="script">K</mml:mi> </mml:math> -lexicographic-max product of neutrosophic graph

Nasreen Kausar, Nasser Elkanj, Vladimir Šimić, M. Kaviyarasu et al.
1 citations
Ain Shams Engineering Journal
Multi-Criteria Decision Making
2.11
article

Food safety risk analysis utilising <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"> <mml:mi mathvariant="script">K</mml:mi> </mml:math> -lexicographic-max product of neutrosophic graph

Nasreen Kausar, Nasser Elkanj, Vladimir Šimić, M. Kaviyarasu, Dragan Pamučar, M. Rajeshwari
article en
1 citations

Abstract

In this study, we introduce the concept of the K-Lexicographic Max Product (K−LMP) of neutrosophic graphs and explore its associated degree structure to enhance decision-making frameworks in food safety applications related to risk assessment, including freshness, contamination, and spoilage. Neutrosophic graphs, capable of handling indeterminacy, inconsistency, and incompleteness, provide a flexible mathematical foundation for modelling complex systems. By incorporating the K−LMP into neutrosophic graphs, we offer a novel approach to comparing and ranking food safety scenarios where multiple attributes and uncertain information coexist. We present example graphs and theorems related to K−LMP and further define the K-Lexicographic degree to quantify node significance within the context of neutrosophic graphs. To validate the practical utility of this approach, a food safety analysis is implemented, demonstrating how the model identifies critical control points and supports more robust, transparent decision-making under uncertainty. This work contributes to the advancement of neutrosophic graph theory and its interdisciplinary application in food quality and safety management.

Ain Shams Engineering JournalVol. 16(12)
Openalex Percentile: Top 10%
Multi-Criteria Decision Making
2.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.