The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Domination Theory in Graphs
Abstract
The study of domination in graphs originated around 1850 with the problems of placing minimum number of queens or other chess pieces on an n x n chess board so as to cover/dominate every square. The rules of chess specify that in one move a queen can advance any number of squares horizontally, vertically, or diagonally as long as there are no other chess pieces in its way. In 1850 enthusiasts who studied the problem came to the correct conclusion that all the squares in an 8 x 8 chessboard can be dominated by five queens and five is the minimum such number. With very few exceptions (Rooks, Bishops), these problems still remain unsolved today. Let G = (V,E) be a graph. A set S ⊂ V is a dominating set of G if every vertex in V–S is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set.
Related Content
|
Vinod Kumar, Himanshu Prajapati, Sasikala Ponnusamy.
© 2023.
18 pages.
|
|
Sougatamoy Biswas.
© 2023.
14 pages.
|
|
Ganga Devi S. V. S..
© 2023.
10 pages.
|
|
Gotam Singh Lalotra, Ashok Sharma, Barun Kumar Bhatti, Suresh Singh.
© 2023.
15 pages.
|
|
Nimish Kumar, Himanshu Verma, Yogesh Kumar Sharma.
© 2023.
16 pages.
|
|
R. Soujanya, Ravi Mohan Sharma, Manish Manish Maheshwari, Divya Prakash Shrivastava.
© 2023.
12 pages.
|
|
Nimish Kumar, Himanshu Verma, Yogesh Kumar Sharma.
© 2023.
22 pages.
|
|
|