Certified Domination Number in Product of Graphs
Main Article Content
Abstract
A set S of vertices in G = (V, E) is called a dominating set of G if every vertex not in S
has at least one neighbour in S. A dominating set S of a graph G is said to be a certified
dominating set of G if every vertex in S has either zero or at least two neighbours in
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
