EUVIMEDDécouvrir EUVIMED
Crossref

Introduction for SuperHyperGraph Labeling and MultiLabeling

Takaaki Fujita

Journal of Computers and Applications · 2025-11-07 · 1 (1) · 23

DOI: 10.58613/jca112 ↗

At a glance

Journal article in Journal of Computers and Applications, published online on 2025-11-07. Written by Takaaki Fujita.

RésuméRéférences bibliographiquesCiteRelated studies

Abstract (original language)

A finite hypergraph generalizes the classical graph model by allowing hyperedges that can connect any nonempty subset of vertices. Building on this foundation, a finite SuperHyperGraph is obtained through iterative application of the powerset construction, thereby creating nested families of vertex and edge sets that capture multi-layered relationships. Graph labeling assigns numbers or symbols to vertices and/or edges of a graph under rules, modeling constraints, optimization, or communication. In this paper, we define and study the mathematical properties of Graph Labeling, HyperGraph Labeling, SuperHyper- Graph Labeling, Graph MultiLabeling, HyperGraph MultiLabeling, and SuperHyperGraph MultiLabeling.

Cite

APA

Fujita, T. (2025). Introduction for SuperHyperGraph Labeling and MultiLabeling. Journal of Computers and Applications, 1(1), 23. https://doi.org/10.58613/jca112

Vancouver

Fujita T. Introduction for SuperHyperGraph Labeling and MultiLabeling. Journal of Computers and Applications. 2025;1(1):23. doi:10.58613/jca112

BibTeX
@article{Fujita2025,
  author = {Fujita, Takaaki},
  title = {Introduction for SuperHyperGraph Labeling and MultiLabeling},
  journal = {Journal of Computers and Applications},
  year = {2025},
  volume = {1},
  number = {1},
  pages = {23},
  doi = {10.58613/jca112}
}
Start for free →