Journal Paper

Paper Information

video

sound

Persian Version

View:

15,482

Download:

9,452

Cites:

Information Journal Paper

Title

THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF GRAPHS

Pages

 Start Page 19 | End Page 30

Abstract

 A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbor in D. A geodetic dominating set S is both a geodetic and a dominating set. The geodetic (domination, geodetic domination) number g(G) (g(G), gg (G)) of G is the minimum cardinality among all geodetic (dominating, geodetic dominating) sets in G. In this paper, we show that if a triangle free graph G has minimum degree at least 2 and g (G) =2, then gg(G) = g(G). It is shown, for every nontrivial connected graph G with g (G) =2 and diam (G)>3, that gg (G)>g (G). The lower bound for the geodetic DOMINATION NUMBER of CARTESIAN PRODUCT graphs is proved. Geodetic DOMINATION NUMBER of product of cycles (paths) are determined. In this work, we also determine some bounds and exact values of the geodetic DOMINATION NUMBER of STRONG PRODUCT of graphs.

Cites

  • No record.
  • References

  • No record.
  • Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops