Perfect difference graphs
Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 339-352
DOI: 10.61091/jcmcc131-16 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von KM. Kathiresan und 2 weiteren Autor:innen.
Abstract (Originalsprache)
The sum graph \(G^{+}(S)\) of a finite subset \(S\subset \mathbb{N}\)={1,2,3,...} is the graph (V,E) where V=S and \(uv\in\)E if and only if \(u+v\in\) S. This concept was introduced by Harary [9], where some basic properties of the family of all sum graphs were presented. In [10], Harary extended this definition into an integral sum graph and proposed some open problems. Motivated by these definitions, we introduce a graph called perfect difference graph. We investigate the properties of this family of graphs.
Zitieren
APA
Kathiresan, K., Jothi, P. N., & Gnanachandra, P. (2026). Perfect difference graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 339-352. https://doi.org/10.61091/jcmcc131-16
Vancouver
Kathiresan K, Jothi PN, Gnanachandra P. Perfect difference graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:339-352. doi:10.61091/jcmcc131-16
BibTeX
@article{Kathiresan2026,
author = {Kathiresan, KM. and Jothi, P. Naga and Gnanachandra, P.},
title = {Perfect difference graphs},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {131},
pages = {339--352},
doi = {10.61091/jcmcc131-16}
}
EUVIMED