EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

SET-CORDIALITY INDEX OF BIPARTITE GRAPHS VIA BOOLEAN LAYERS AND HYPERCUBE EMBEDDINGS

U. M. Prajapati, K. R. Odedara

Advances and Applications in Discrete Mathematics · 06.07.2026 · 43 (6) · 825-843

DOI: 10.17654/0974165826051 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 06.07.2026. Verfasst von U. M. Prajapati und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the set-cordiality index of graphs, a set-valued labeling parameter introduced by Naduvath [7], and develop a general framework for bipartite graphs. A universal lower bound is established in terms of the larger partite class, along with a sufficient condition for its attainment using three consecutive layers of the Boolean lattice. To handle cases beyond this criterion, we introduce a hypercube subgraph principle, which links set-cordial labelings to graph embeddings in hypercubes. As applications, we determine exact set-cordiality indices for ladder graphs and even prism graphs, and a couple of additional results by direct arguments rather than the established principle. The results highlight the role of Boolean layer capacities and embedding structures, and we conclude with conjectures for trees and Cartesian product graphs.

Zitieren

APA

Prajapati, U. M., & Odedara, K. R. (2026). SET-CORDIALITY INDEX OF BIPARTITE GRAPHS VIA BOOLEAN LAYERS AND HYPERCUBE EMBEDDINGS. Advances and Applications in Discrete Mathematics, 43(6), 825-843. https://doi.org/10.17654/0974165826051

Vancouver

Prajapati UM, Odedara KR. SET-CORDIALITY INDEX OF BIPARTITE GRAPHS VIA BOOLEAN LAYERS AND HYPERCUBE EMBEDDINGS. Advances and Applications in Discrete Mathematics. 2026;43(6):825-843. doi:10.17654/0974165826051

BibTeX
@article{Prajapati2026,
  author = {Prajapati, U. M. and Odedara, K. R.},
  title = {SET-CORDIALITY INDEX OF BIPARTITE GRAPHS VIA BOOLEAN LAYERS AND HYPERCUBE EMBEDDINGS},
  journal = {Advances and Applications in Discrete Mathematics},
  year = {2026},
  volume = {43},
  number = {6},
  pages = {825--843},
  doi = {10.17654/0974165826051}
}
Kostenlos starten →