Characterization of signed paths and cycles admitting minus dominating function
Minus dominating function; Minus domination; Signed graphs
Let G = (V, E, ?) be a finite signed graph. A function f: V ? {?1, 0, 1} is a minus dominating function (MDF) of G if f(u) + Pv?N(u) ?(uv)f(v) ? 1 for all u ? V. In this paper we characterize signed paths and cycles admitting an MDF. 2020 Azarbaijan Shahid Madani University
Communications in Combinatorics and Optimization, Vol-5, No. 1, pp. 61-68.
https://doi.org/10.22049/CCO.2019.26661.1128 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096952316&doi=10.22049%2fCCO.2019.26661.1128&partnerID=40&md5=e8d20dfb0517ad33fa917cc19df67e71
Shreyas S.R., Department of Mathematics, CHRIST (Deemed to be University), Bangalore-29, India; Joseph M., Department of Mathematics, CHRIST (Deemed to be University), Bangalore-29, India