|
|||||
|
|
Perfect Domination Polynomial of Homogeneous Caterpillar Graphs and of Full Binary Trees |
|
| Authors: | Yimer Temesgen Engida Baskar Babujee J |
| Institution: | 1.Department of Mathematics, Anna University, MIT Campus, Chennai, 600044, India ; |
| Abstract: | Mathematical Notes - Let $$G=(V,E)$$ be a simple graph of order $$n$$ . A set $$S \subseteq V(G)$$ is a perfect dominating set of a graph $$G$$ if every vertex $$v\in V(G)-S$$ is adjacent to... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |