EUVIMEDEUVIMED entdecken
Crossref

ON THE RELATION BETWEEN SEQUENTIAL AND PRIME LABELINGS OF DIGRAPHS AND THEIR COMPUTATIONAL APPLICATIONS

ANUSHA, KUMUDAKSHI

Global and Stochastic Analysis · 2026

DOI: 10.64837/gsa.13.5.6 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Global and Stochastic Analysis, 2026. Verfasst von ANUSHA und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we bridge the gap in directed graph analysis by combining sequential and prime labeling techniques, establishing a relationship between these two labeling methods for certain classes of directed graphs. This study offers valuable insights into the structural properties of digraphs, revealing novel connections that enhance the theoretical foundation of graph labeling. Our findings contribute to a deeper understanding of directed graph labeling and open new avenues for research in graph theory and its applications in both mathematical and computational domains. Building upon this, we propose a novel framework that integrates coined quantum walks, entropy-guided encryption, and secure robotic path planning over sequentially labeled digraphs. Two key security mechanisms are introduced: Path Entropy Masking, which obfuscates the robot’s route by embedding dummy transitions, and Message Entropy Masking, which ensures message confidentiality through the use of entropy-derived noise vectors. These mechanisms are implemented within a quantum-inspired navigation model utilizing coin and shift operators defined on a Hilbert space formed by graph positions and transition directions. The robot evaluates multiple acyclic paths from source to destination using quantum entropy metrics, trust scores, and machine learning-based safety predictions. A multi-criteria decision-making strategy is then employed to select the most secure and efficient path. Encrypted communication is conducted along this trusted path using entropy-masked encoding, thereby ensuring both safe traversal and secure message delivery.

Zitieren

APA

ANUSHA, & KUMUDAKSHI (2026). ON THE RELATION BETWEEN SEQUENTIAL AND PRIME LABELINGS OF DIGRAPHS AND THEIR COMPUTATIONAL APPLICATIONS. Global and Stochastic Analysis. https://doi.org/10.64837/gsa.13.5.6

Vancouver

ANUSHA, KUMUDAKSHI. ON THE RELATION BETWEEN SEQUENTIAL AND PRIME LABELINGS OF DIGRAPHS AND THEIR COMPUTATIONAL APPLICATIONS. Global and Stochastic Analysis. 2026. doi:10.64837/gsa.13.5.6

BibTeX
@article{ANUSHA2026,
  author = {ANUSHA and KUMUDAKSHI},
  title = {ON THE RELATION BETWEEN SEQUENTIAL AND PRIME LABELINGS OF DIGRAPHS AND THEIR COMPUTATIONAL APPLICATIONS},
  journal = {Global and Stochastic Analysis},
  year = {2026},
  doi = {10.64837/gsa.13.5.6}
}
Kostenlos starten →