A graph G is an undirected finite connected graph. A function f : V (G) → [0, 1] is called a fractional dominating function if, ∑u∈N[v]f (u) ≥1, for all v ∈ V, where N [v] is the closed neighborhood of v. The weight of a fractional dominating function is w (f) = ∑v∈V(G)f (v). The fractional domination number γf (G) has the least weight of all the fractional dominating functions of G. In this paper, we analyze the effects on γf (G) of deleting a vertex from G. Additionally, some bounds on γf (G) are discussed, and provide the exactness of some bounds. If we remove any leaves from any tree T, then the resulting graphs are , where |l| is the number of leaves. Some of the results are proved by the eccentricity value of a vertex e (v).
AmuthaS. and SridharanN., A note on sets of a simple graph G with δ (G) ≥2, Journal of Pure and Applied Mathematics: Advances and Applications9 (2013), 69–79.
2.
ArumugamS.Sithara JerryFractional Edge Domination in Graphs, Applicable Analysis and Discrete Mathematics3 (2009), 359–370.
3.
BalamuruganS., Changing and unchanging isolate domination: Edge removal, Discrete Mathematics Algorithms and Applications9(1) (2017).
4.
BhanumathiM.Sudhasenthil, Changing and unchanging of eccentric domination number in graphs, International Journal of Pure and Applied Mathematics118(23) (2018), 373–381.
5.
HaynesT.W., HedetniemiS.T., SlaterP.J.Fundamentals of domination in Graphs, Marcel Dekker, Inc., (1998).
6.
HararyF. Graph Theory, Addison wesley Publishing Company Reading, Massachuretts, (1972).
7.
JanakiramanT.N., AlphonseP.J.A. and SangeethaV., Changing and Unchanging of distance closed domination number in graphs, International Journal of Engineering Science, Advanced Computing and Bio-Technology3(2) (2012), 67–84.
8.
MuhiuddinG., SridharanN., Al-kadiD., AmuthaS. and ElnairM.E., Reinforcement Number of a Graph with respect to Half-Domination, Hindawi Journal of Mathematics2021 (2021), 7 Article ID 6689816.
9.
Roushini Leely PushpamP. and ShanthiP.A., Changing and unchanging in m-eternal total domination in graphs, Electronic Notes in Discrete Mathematics53 (2016), 181–198.
10.
ScheinermanE.R., UllmanD.H. Fractional Graph Theory: A rational approach to the theory of graphs, JohnWiley and Sons Inc., (1997).
11.
SridharanN., AmuthaS. and RameshA., Babu, Bounds for λ- domination number γ _ λ (G) of a graph, Journal of Computational Mathematica1(2) (2017), 79–90.
12.
Suriya PrabhaK.AmuthaS.AnbazhaganN.Sankara GomathiS., Neighborhood outer split domination in graphs, Journal of Discrete Mathematical Sciences and Cryptography22(5) (2019), 787–799.
