EUVIMEDEUVIMED entdecken
Crossref

Efficient enumeration of cliques in graphs with bounded maximum degree

Shi-Cai Gong, Jia-Jin Wang, Xin-Hao Zhu, Bo-Jun Yuan

Computational and Applied Mathematics · 2026-12 · 45 (10)

DOI: 10.1007/s40314-026-03804-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computational and Applied Mathematics, online erschienen am 25.05.2026. Verfasst von Shi-Cai Gong und 3 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Supported by National Natural Science Foundation of Chin.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In recent years, there has been a surge of interest in extremal problems concerning the enumeration of independent sets or cliques in graphs with specific constraints. For instance, the Kahn–Zhao theorem establishes an upper bound on the number of independent sets in a d-regular graph; Cutler and Radcliffe identified the extremal graphs that maximize the number of cliques for a given order and maximum degree. In this paper, we introduce an innovative approach for counting cliques in graphs with a bounded maximum degree. To demonstrate the effectiveness of the method, we provide a new proof for the above Cutler–Radcliffe theorem.

Förderung

  • National Natural Science Foundation of China
  • Supported by National Natural Science Foundation of Chin

Zitieren

APA

Gong, S., Wang, J., Zhu, X., & Yuan, B. (2026). Efficient enumeration of cliques in graphs with bounded maximum degree. Computational and Applied Mathematics, 45(10). https://doi.org/10.1007/s40314-026-03804-3

Vancouver

Gong S, Wang J, Zhu X, Yuan B. Efficient enumeration of cliques in graphs with bounded maximum degree. Computational and Applied Mathematics. 2026;45(10). doi:10.1007/s40314-026-03804-3

BibTeX
@article{Gong2026,
  author = {Gong, Shi-Cai and Wang, Jia-Jin and Zhu, Xin-Hao and Yuan, Bo-Jun},
  title = {Efficient enumeration of cliques in graphs with bounded maximum degree},
  journal = {Computational and Applied Mathematics},
  year = {2026},
  volume = {45},
  number = {10},
  doi = {10.1007/s40314-026-03804-3}
}
Kostenlos starten →