• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Contour sets in product graphs

Su, Fang-Mei 22 July 2009 (has links)
For a vertex x of G, the eccentricity e (x) is the distance between x and a vertex farthest from x. Then x is a contour vertex if there is no neighbor of x with its eccentricity greater than e (x). The x-y path of length d (x,y) is called a x-y geodesic. The geodetic interval I [x,y] of a graph G is the set of vertices of all x-y geodesics in G. For S ⊆ V , the geodetic closure I [S] of S is the union of all geodetic intervals I [x,y] over all pairs x,y ∈S. A vertex set S is a geodetic set for G if I [S] = V (G). In this thesis, we study the contour sets of product graphs and discuss these sets are geodetic sets for some conditions.

Page generated in 0.0433 seconds