Bounds on the k -domination number of a graph

The k -domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k -domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In pa...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematics letters 2011-06, Vol.24 (6), p.996-998
Hauptverfasser:	DeLaViña, Ermelinda, Goddard, Wayne, Henning, Michael A., Pepper, Ryan, Vaughan, Emil R.
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-domination Computer programs Exact sciences and technology Graph Graphs Independence number Matching Matching number Mathematical analysis Mathematical models Mathematics Numerical analysis Numerical analysis. Scientific computation Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!