Nidha, Devadhas and Kala, Murugan (2023) Edge-Domsaturation Number of a Graph: A Mathematical Approach. In: Research Highlights in Mathematics and Computer Science Vol. 6. B P International, pp. 51-63. ISBN 978-81-19102-02-0
Full text not available from this repository.
Official URL: https://doi.org/10.9734/bpi/rhmcs/v6/4661A
Abstract
The edge-domsaturation number ds' (G) of a graph G=(V,E) is the least positive integer k such that every edge of G lies in an edge dominating set of cardinality k. In this paper, we characterize unicyclic graphs G with ds' (G)=q- ' (G) and investigate well-edge dominated graphs. We further define '-critical, '+-critical, ds'-critical, ds'-critical edges and study some of their properties.
| Item Type: | Book Section |
|---|---|
| Subjects: | Open Research Librarians > Mathematical Science |
| Depositing User: | Unnamed user with email support@open.researchlibrarians.com |
| Date Deposited: | 02 Oct 2023 05:46 |
| Last Modified: | 02 Oct 2023 05:46 |
| URI: | http://stm.e4journal.com/id/eprint/1588 |
Actions (login required)
- View Item