Toplam kayıt 2, listelenen: 1-2

    • Edge domination in some brick product graphs 

      Kumar, U. Vijaya Chandra; Murali, R.; Girisha, A. (Işık University Press, 2020)
      Let G = (V, E) be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E − F is adjacent to at least one edge in F. The edge domination number γ′ (G) of G is ...
    • Edge H-domination in graph 

      Kakrecha, Bhavesh (Işık University Press, 2021)
      This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the characterization of a minimal edge H-dominating set of the graph with minimum degree 2 is given. The upper bound on the edge ...