EUVIMEDEUVIMED entdecken
Crossref

Graph product techniques for cordial labeling on cubic root graph structures

J. Senbagamalar, D. Ramani Bai

Journal of Information & Optimization Sciences · 2026 · 47 (4) · 1479-1488

DOI: 10.47974/jios-2191 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Information & Optimization Sciences, 2026. Verfasst von J. Senbagamalar und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph labeling is the term used to describe the procedure of giving unique identifiers. Graph attributing is a method for modeling real-world problems in industries such as circuit design, surveillance technology, and telecommunications networks. A graph is characterized as possessing cubic roots cordial labeling if each node is designated with either the value 1, δ or δ2 or another specified integer. The derived set containing the value 1 or another integer, the mathematical conditions η (k) − η (w)| ≤ 1 and | ξ (k) − ξ (w)| ≤ 1, k ≠ w and k, w ∈ {1, δ, δ2} where η (k) and ξ (k) are represents the aggregated vertices and edges assigned in k ∈ {1, δ, δ2}. Labeled graphs prove to be immensely beneficial across a variety of mathematical frameworks, including domains such as cyber security and radar code formulation. The application of cordial labeling has been demonstrated to provide significant advantages in the context of signal processing channels and challenges associated with specific code word design. The idea of cubic roots cordial labeling has attracted a lot of academic attention among various labeling techniques, unique structural characteristics and capacity to depict a fair flow of information within linked networks. The investigation of the behavior of cubic roots cordial labeling in relation to graph operations is currently receiving extensive scholarly examination, particularly concerning path graphs, despite its critical relevance. This paper explore the cordial labeling of cubic product graphs generated from the combination of two path graphs. The four fundamental graph operations on which we particularly focus on activities, we analyze the specific conditions to possess cubic roots cordial labeling.

Zitieren

APA

Senbagamalar, J., & Bai, D. R. (2026). Graph product techniques for cordial labeling on cubic root graph structures. Journal of Information & Optimization Sciences, 47(4), 1479-1488. https://doi.org/10.47974/jios-2191

Vancouver

Senbagamalar J, Bai DR. Graph product techniques for cordial labeling on cubic root graph structures. Journal of Information & Optimization Sciences. 2026;47(4):1479-1488. doi:10.47974/jios-2191

BibTeX
@article{Senbagamalar2026,
  author = {Senbagamalar, J. and Bai, D. Ramani},
  title = {Graph product techniques for cordial labeling on cubic root graph structures},
  journal = {Journal of Information & Optimization Sciences},
  year = {2026},
  volume = {47},
  number = {4},
  pages = {1479--1488},
  doi = {10.47974/jios-2191}
}
Kostenlos starten →