EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

EFFICIENT ALGORITHMS FOR COMPUTING BOUNDS, EXACT VALUES OF $\chi(p)$ IN STRONGLY MULTIPLICATIVE GRAPHS

S. Shashirekha, M. Smitha, P. Padmapriya, C. K. Honnegowda

Far East Journal of Mathematical Sciences (FJMS) · 11.04.2026 · 143 (4) · 1151-1166

DOI: 10.17654/0972087126066 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 11.04.2026. Verfasst von S. Shashirekha und 3 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we present efficient algorithms to compute improved upper and lower bounds for $\chi(p)$, the maximum number of edges in strongly multiplicative graphs, based on refined number-theoretic inequalities. The proposed upper bound algorithm utilizes least prime divisors, their highest powers, and residual functions, yielding bounds that are tighter than previously reported results. A complementary algorithm is introduced to obtain lower bounds using prime counting techniques, and numerical comparisons demonstrate that these bounds are close to the exact values. Furthermore, we propose an array-based algorithm that computes the exact value of $\chi(p)$ by systematically generating distinct edge labels. Computational results confirm the correctness and effectiveness of the proposed algorithms for graphs with a large number of vertices. The methods presented in this work enhance both the theoretical understanding and practical computation of strongly multiplicative graphs. Received: January 16, 2026Revised: February 19, 2026Accepted: March 18, 2026

Zitieren

APA

Shashirekha, S., Smitha, M., Padmapriya, P., & Honnegowda, C. K. (2026). EFFICIENT ALGORITHMS FOR COMPUTING BOUNDS, EXACT VALUES OF $\chi(p)$ IN STRONGLY MULTIPLICATIVE GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(4), 1151-1166. https://doi.org/10.17654/0972087126066

Vancouver

Shashirekha S, Smitha M, Padmapriya P, Honnegowda CK. EFFICIENT ALGORITHMS FOR COMPUTING BOUNDS, EXACT VALUES OF $\chi(p)$ IN STRONGLY MULTIPLICATIVE GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(4):1151-1166. doi:10.17654/0972087126066

BibTeX
@article{Shashirekha2026,
  author = {Shashirekha, S. and Smitha, M. and Padmapriya, P. and Honnegowda, C. K.},
  title = {EFFICIENT ALGORITHMS FOR COMPUTING BOUNDS, EXACT VALUES OF $\chi(p)$ IN STRONGLY MULTIPLICATIVE GRAPHS},
  journal = {Far East Journal of Mathematical Sciences (FJMS)},
  year = {2026},
  volume = {143},
  number = {4},
  pages = {1151--1166},
  doi = {10.17654/0972087126066}
}
Kostenlos starten →