• Title of article

    Edge-Domsaturation Number of a Graph

  • Author/Authors

    Nidha ، D. - Manonmaniam Sundaranar University , Kala ، R. - Manonmaniam Sundaranar University

  • Pages
    10
  • From page
    1
  • To page
    10
  • 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. The connected edge-domsaturation number ds c(G) of a graph G=(V, E) is the least positive integer k such that every edge of G lies in a connected edge dominating set of cardinality k. In this paper, we obtain several results connecting ds (G),ds c(G)and other graph theoretic parameters.
  • Keywords
    edge , dominating set , edge , domination number , edge , domsaturation number , connected edge , domsaturation number ,
  • Journal title
    General Mathematics Notes
  • Serial Year
    2012
  • Journal title
    General Mathematics Notes
  • Record number

    2457473

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=2457473