This paper studies strongly $^{*}$-graphs as a variation of strongly multiplicative graphs. We show that every strongly multiplicative graph induces a strongly $^{*}$-graph. We establish a relationship between the upper bounds on the number of edges of strongly $^{*}$-graphs $\lambda^{*}(n)$ and strongly multiplicative graphs, and identify a condition under which the upper bound for strongly $^{*}$-graphs exceeds that of strongly multiplicative graphs, we show that this condition holds for infinitely many values of $n$. We derive explicit formulas for $ lambda^{*}(n)$. Finally, we prove the independence of several necessary conditions for graphs that do not admit strongly$^{*}$-labeling.
| Primary Language | English |
|---|---|
| Subjects | Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics) |
| Journal Section | Research Article |
| Authors | |
| Submission Date | September 4, 2025 |
| Acceptance Date | February 9, 2026 |
| Publication Date | April 7, 2026 |
| IZ | https://izlik.org/JA83WH67SC |
| Published in Issue | Year 2026 Volume: 16 Issue: 4 |