On the Total Outer <i>k</i>-Independent Domination Number of Graphs

On the Total Outer <i>k</i>-Independent Domination Number of Graphs

A set of vertices of a graph <i>G</i> is a total dominating set if every vertex of <i>G</i> is adjacent to at least one vertex in such a set. We say that a total dominating set <i>D</i> is a total outer <i>k</i>-independent dominating set of <i>G...

Full description

Bibliographic Details
Main Authors: Abel Cabrera-Martínez, Juan Carlos Hernández-Gómez, Ernesto Parra-Inza, José María Sigarreta Almira
Format: Article
Language:English
Published: MDPI AG 2020-02-01
Series:Mathematics
Subjects:
total outer k-independent domination
total domination
k-independence
Online Access:https://www.mdpi.com/2227-7390/8/2/194

Internet

https://www.mdpi.com/2227-7390/8/2/194

Similar Items