id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5313	Karkar, Sejal; Pandya, D.D.; Sonchhatra, S.G.; Maheta, P.D.; Rathod, H.M.; Bhanderi, S.D.	Study on Even Sum Domination Number of Some Graphs	2024	8	.pdf	application/pdf	4077	276	79	Introduction We consider simple, finite, connected and undirected graph G with vertex set V (G) and edge set E(G). If v is not even sum dominated by any vertex of S −{u} but even sum dominated by any vertex of S, then vertex v has only one even sum neighbor u in S, that is Nes(v)∩S = {u}.	cache/ejpam-5313.pdf	txt/ejpam-5313.txt