Open AccessA note on the k‐domination number of a graph
Author(s) -
Yair Caro,
Y. Roditty
Publication year - 1989
Publication title -
international journal of mathematics and mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 39
eISSN - 1687-0425
pISSN - 0161-1712
DOI - 10.1155/s016117129000031x
Subject(s) - mathematics , domination analysis , combinatorics , graph , discrete mathematics , vertex (graph theory)
The k-domination number of a graph G=G(V,E), γk(G), is the least cardinality of a set X⊂V such that any vertex in VX is adjacent to at least k vertices of X
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom