NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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.

Search results

Showing 1 to 1 of 1 (0.055 seconds)

Spelling suggestions: "subject:"2distance comatic cumber"" "subject:"2distance comatic 1umber""

1

Distance-2 Domatic Numbers of Graphs

Kiser, Derek 01 May 2015 (has links)
The distance d(u, v) between two vertices u and v in a graph G equals the length of a shortest path from u to v. A set S of vertices is called a distance-2 dominating set if every vertex in V \S is within distance-2 of at least one vertex in S. The distance-2 domatic number is the maximum number of sets in a partition of the vertices of G into distance-2 dominating sets. We give bounds on the distance-2 domatic number of a graph and determine the distance-2 domatic number of selected classes of graphs.
Domination
Domatic Number
Distance-2 Domination
Distance-2 Domatic Number
Discrete Mathematics and Combinatorics
Mathematics
Physical Sciences and Mathematics

Page generated in 0.0594 seconds