\providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace}
\providecommand{\MR}{\relax\ifhmode\unskip\space\fi MR }
% \MRhref is called by the amsart/book/proc definition of \MR.
\providecommand{\MRhref}[2]{%
  \href{http://www.ams.org/mathscinet-getitem?mr=#1}{#2}
}
\providecommand{\href}[2]{#2}
\begin{thebibliography}{10}

\bibitem{aguilar}
Cesar~O. Aguilar, \emph{Anti-regular graphs with loops and their spectrum},
  2018, Preprint, revised 2019,
  \href{https://arxiv.org/abs/1805.08287v2}{arXiv:1805.08287v2}.

\bibitem{allikvere}
Jaan Allikvere, \emph{The edge multiset dimension of hypercubes}, 2026,
  Preprint, \href{https://arxiv.org/abs/2608.09983v1}{arXiv:2608.09983v1}.

\bibitem{beck}
M.~Beck and S.~Robins, \emph{Computing the continuous discretely: Integer-point
  enumeration in polyhedra}, 2nd ed., Undergraduate Texts in Mathematics,
  Springer, New York, 2015.

\bibitem{burstein}
D.~Burstein and J.~Rubin, \emph{Sufficient conditions for graphicality of
  bidegree sequences}, SIAM J. Discrete Math. \textbf{31} (2017), no.~1,
  50--62.

\bibitem{cilleruelo}
J.~Cilleruelo, \emph{Combinatorial problems in finite fields and {Sidon} sets},
  Combinatorica \textbf{32} (2012), no.~5, 497--511.

\bibitem{cloteaux}
Brian Cloteaux, \emph{A sufficient condition for graphic sequences with given
  largest and smallest entries, length, and sum}, Discrete Mathematics \&
  Theoretical Computer Science \textbf{20} (2018), no.~1, 25.

\bibitem{dusart1999}
Pierre Dusart, \emph{In\'egalit\'es explicites pour {$\psi(X)$}, {$\theta(X)$},
  {$\pi(X)$} et les nombres premiers}, C. R. Math. Rep. Acad. Sci. Canada
  \textbf{21} (1999), 53--59.

\bibitem{erdos}
P.~Erd{\H{o}}s and P.~Tur{\'a}n, \emph{On a problem of {Sidon} in additive
  number theory, and on some related problems}, J. London Math. Soc.
  \textbf{16} (1941), no.~4, 212--215.

\bibitem{farhan}
M.~Farhan, S.~Klav{\v{z}}ar, D.~Kuziak, and I.~G. Yero, \emph{Multiset
  resolvability parameters in graphs: A survey with new results and open
  problems}, 2026, Preprint,
  \href{https://arxiv.org/abs/2607.10311v1}{arXiv:2607.10311v1}.

\bibitem{fulkerson}
D.~R. Fulkerson, \emph{Zero-one matrices with zero trace}, Pacific J. Math.
  \textbf{10} (1960), no.~3, 831--836.

\bibitem{ikhlaq}
H.~M. Ikhlaq, R.~Ismail, H.~M.~A. Siddiqui, and M.~F. Nadeem, \emph{A new
  technique to uniquely identify the edges of a graph}, Symmetry \textbf{15}
  (2023), no.~3, 762.

\bibitem{kelenc}
A.~Kelenc, N.~Tratnik, and I.~G. Yero, \emph{Uniquely identifying the edges of
  a graph: The edge metric dimension}, Discrete Appl. Math. \textbf{251}
  (2018), 204--220.

\bibitem{knor}
Martin Knor, Riste {\v{S}}krekovski, and Ismael~G. Yero, \emph{A note on the
  metric and edge metric dimensions of 2-connected graphs}, Discrete Applied
  Mathematics \textbf{319} (2022), 454--460.

\bibitem{lapkova2018}
Kostadinka Lapkova, \emph{Correction to: Explicit upper bound for the average
  number of divisors of irreducible quadratic polynomials}, Monatshefte f\"ur
  Mathematik \textbf{186} (2018), 675--678.

\bibitem{ruiz}
D.~Ruiz and C.~Trujillo, \emph{Construction of {$B_h[g]$} sets in product of
  groups}, Rev. Colombiana Mat. \textbf{50} (2016), no.~2, 165--174.

\bibitem{zverovich1992}
I.~E. Zverovich and V.~E. Zverovich, \emph{Contributions to the theory of
  graphic sequences}, Discrete Mathematics \textbf{105} (1992), no.~1--3,
  293--303.

\end{thebibliography}