Ivan Damnjanović, Marko Milošević, Dragan Stevanović
We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy tree has the minimum Sombor index, while an alternating greedy tree has the maximum Sombor index.
Marko Milosevic, Narad Rampersad
We give a partial answer to a problem of Harju by constructing an infinite ternary squarefree word $w$ with the property that for every $k \geq 3312$ there is an interior length-$k$ factor of $w$ that can be deleted while still preserving squarefreeness. We also examine Thue's famous squarefree word (generated by iterating the map $0 \to 012$, $1 \to 02$, $2 \to 1$) and characterize the positions $i$ for which deleting the symbol appearing at position $i$ preserves squarefreeness.
Pete L. Clark, Marko Milosevic, Paul Pollack
We formulate the notion of \emph{typical boundedness} of torsion on a family of abelian varieties defined over number fields. This means that the torsion subgroups of elements in the family can be made uniformly bounded by removing from the family all abelian varieties defined over number fields of degree lying in a set of arbitrarily small density. We show that for each fixed $g$, torsion is typically bounded on the family of all $g$-dimensional CM abelian varieties. We show that torsion is \emph{not} typically bounded on the family of all elliptic curves, and we establish results -- some unconditional and some conditional -- on typical boundedness of torsion of elliptic curves for which the degree of the $j$-invariant is fixed.
Péter Csikvári, Ivan Damnjanović, Marko Milošević, Ivan Stanković, Dragan Stevanović
The energy $E(G)$ of a simple graph $G$ is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order $n \in \mathbb{N}$ is any noncomplete graph~$G$ such that $E(G) = E(K_n) = 2n - 2$. Here we combine two-phase computer-assisted search with theoretical arguments to show that there are only three borderenergetic chemical graphs, thus completing the earlier findings of Li, Wei and Zhu [MATCH Commun. Math. Comput. Chem. 77 (2017), 25-36]. We perform two-phase computer-assisted search to also find all $566$ borderenergetic graphs of order~$12$, thereby correcting and extending the results from a previous search performed by Furtula and Gutman [Iranian J. Math. Chem. 8(4) (2017), 339-344].