Characterization of Fractional Mixed Domination Number of Paths and Cycles

Let G′ be a simple, connected, and undirected (UD) graph with the vertex set M(G′) and an edge set N(G′). In this article, we define a function f:M∪N⟶0,1 as a fractional mixed dominating function (FMXDF) if it satisfies fRmx=∑yϵRmxfy≥1 for all x∈MG′∪NG′, where Rmx indicates the closed mixed neighbourhood of x, that is the set of all y∈MG′∪NG′ such that y is adjacent to x and y is incident with x and also x itself. Here, pf=∑x∈M∪Nfx is the poundage (or weight) of f. The fractional mixed domination number (FMXDN) is denoted by γfm∗G′ and is designated as the lowest poundage among all FMXDFs of G′. We compute the FMXDN of some common graphs such as paths, cycles, and star graphs, the middle graph of paths and cycles, and shadow graphs. Furthermore, we compute upper bounds for the sum of the two fractional dominating parameters, resulting in the inequality γf1′Τ+γfm∗Τ≤r+p−radΤ−α, where γf1′ and γfm∗ are the fractional edge domination number and FMXDN, respectively. Finally, we compare γfm∗ to other resolvability-related parameters such as metric and fault-tolerant metric dimensions on some families of graphs.