- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Dominating Sets and Domination Polynomial of Complete Graphs with Missing Edges | ||
| Journal of Kufa for Mathematics and Computer | ||
| Article 1, Volume 2, Issue 1, 2015, Pages 64-68 | ||
| Authors | ||
| Abdul Jalil M. Khalaf; Sahib Shayyal Kahat | ||
| Abstract | ||
| Let be a simple graph. set is a dominating set of , if every vertex in is adjacent to at least one vertex in . Let be complete graph with order n. Let be the family of dominating sets of a complete with cardinality , and let . In this paper, we construct , and obtain a recursive formula for . Using this recursive formula, we consider the polynomial , which we call domination polynomial of complete graphs and obtain some properties of this polynomial. | ||
| Keywords | ||
| simple graph Dominating Sets Complete Graphs Missing Edges | ||
|
Statistics Article View: 184 PDF Download: 109 |
||