https://www.rajpub.com/index.php/jam en-US <p><a href="http://creativecommons.org/licenses/by/4.0/" rel="license"><img src="https://i.creativecommons.org/l/by/4.0/88x31.png" alt="Creative Commons License" /></a> All articles published in <em>Journal of Advances in Linguistics</em> are licensed under a <a href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</a>.</p> editor@rajpub.com (Editorial Office) jam@rajpub.comJ (Bavneet Kaur) Tue, 04 Feb 2025 07:27:38 +0000 OJS 3.3.0.7 http://blogs.law.harvard.edu/tech/rss 60 https://www.rajpub.com/index.php/jam/article/view/9697 <p>In this paper, we will prove that with the use of Vieta's formulas, it is possible to apply a unified method in solving equations of the third and fourth degree.</p> Miloš Čojanović Copyright (c) 2025 Miloš Čojanović https://creativecommons.org/licenses/by/4.0 https://www.rajpub.com/index.php/jam/article/view/9697 Tue, 04 Feb 2025 00:00:00 +0000 https://www.rajpub.com/index.php/jam/article/view/9714 <p>The p-Sombor index of a graphs G is deffned as, SOp(G) = X xy∈E(G) (d p (x) + d p (y)) 1 p , where d(x) represents the degree of vertex x in graph G. Our focus centers on exploring the p-Sombor index of unicyclic graphs, speciffcally addressing graphs with a predetermined girth. We determine the ffrst four smallest p-Sombor index and identifying the corresponding graphs that achieve these extremes.</p> Ting Li, Bingjun li Copyright (c) 2025 Ting Li, Bingjun li https://creativecommons.org/licenses/by/4.0 https://www.rajpub.com/index.php/jam/article/view/9714 Fri, 28 Mar 2025 00:00:00 +0000