• Title of article

    Edge-Domsaturation Number of a Graph

  • Author/Authors

    Nidha، D. نويسنده Department of Mathematics,Manonmaniam Sundaranar University,Tirunelveli,India , , Kala، R. نويسنده Department of Mathematics,Manonmaniam Sundaranar University,Tirunelveli,India ,

  • Issue Information
    ماهنامه با شماره پیاپی سال 2012
  • 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 dsc(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),dsc(G)and other graph theoretic parameters.
  • Keywords
    edge-domination number , edge-dominating set , connected edge-domsaturation number , , edge-domsaturation number
  • Journal title
    General Mathematics Notes
  • Journal title
    General Mathematics Notes
  • Record number

    2400584

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