The edge-domsaturation number ds' (G) of a diagram G=(V,E) is the least natural number k such that all edge of G lies in an edge controlling set of cardinality k. In this paper, we characterize unicyclic graphs G with ds' (G)=q-Δ' (G) and examine well-edge dominated graphs. We further delimit λ'-critical, λ'+-detracting, ds'-critical, ds'-fault-finding edges and study some of their characteristics.
Author(s) Details:
Devadhas Nidha,
Department of Mathematics, Manonmaniam
Sundaranar University, Tirunelveli, India.
Murugan
Kala,
Department
of Mathematics, Manonmaniam Sundaranar University, Tirunelveli, India.
Please see the link here: https://stm.bookpi.org/RHMCS-V6/article/view/9679
No comments:
Post a Comment