EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Counting degrees of vertices in near Goldbach graphs

Shamik Ghosh, Souradeep De

Journal of Computational Mathematics and Data Science · 2026-06 · 19 · 100133

DOI: 10.1016/j.jcmds.2026.100133 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computational Mathematics and Data Science, 2026-06. Verfasst von Shamik Ghosh und 1 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Arthritis National Research Foundation, Department of Science and Technology, Government of West Bengal, Université de Montréal.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A near Goldbach graph is a simple undirected graph whose vertex set consists of all positive even integers and there is an edge between two vertices $a,b$ if and only if $\frac{a+b}{2}, \frac{|a-b|}{2}$ are either odd primes or $1$. A finite near Goldbach graph $G(n)$ has the vertex set $\{x\in 2\mathbb{N}\, :\, x\leq 2n\}$ with the same adjacency rule. In this paper, we obtain two exact formulas for the degree of the even positive integer $x$ in $G(x/2)$. We compute a function $\eta(x)=\prod\limits_{p\mid x,\, p>2} \frac{p-1}{p-2}\, \frac{xe^{-0.183407}}{(\log\, x)^2}$ that approximates the degree of $x$ in $G(x/2)$ for a large even positive integer $x$. Finally, we introduce the concept of a nearly independent set of events and show that if the set of divisibility events for a large even integer $x$ is nearly independent, then $x$ can be expressed as the sum of two odd primes.

Förderung

  • Arthritis National Research Foundation
  • Department of Science and Technology, Government of West Bengal
  • Université de Montréal
  • Science and Engineering Research Board
  • Department of Science and Technology, Ministry of Science and Technology, India

Zitieren

APA

Ghosh, S., & De, S. (2026). Counting degrees of vertices in near Goldbach graphs. Journal of Computational Mathematics and Data Science, 19, 100133. https://doi.org/10.1016/j.jcmds.2026.100133

Vancouver

Ghosh S, De S. Counting degrees of vertices in near Goldbach graphs. Journal of Computational Mathematics and Data Science. 2026;19:100133. doi:10.1016/j.jcmds.2026.100133

BibTeX
@article{Ghosh2026,
  author = {Ghosh, Shamik and De, Souradeep},
  title = {Counting degrees of vertices in near Goldbach graphs},
  journal = {Journal of Computational Mathematics and Data Science},
  year = {2026},
  volume = {19},
  pages = {100133},
  doi = {10.1016/j.jcmds.2026.100133}
}
Kostenlos starten →