Domination polynomial of clique cover product of graphs

• Дата: 2020
• Автори: Jahari, Somayeh, Alikhani, Saeid
• Формат: Стаття
• Мова: Англійська
• Опубліковано: Lugansk National Taras Shevchenko University 2020
• Теми: domination polynomial; \(\mathcal{D}\)-equivalence class; clique cover; friendship graphs; 05C60; 05C69
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/401
• Назва журналу: Algebra and Discrete Mathematics

Let \(G\) be a simple graph of order \(n\). We prove that the dominationpolynomial of the clique cover product \(G^\mathcal{C} \star H^{V(H)}\) is\[ D(G^\mathcal{C} \star H,x)=\prod_{i=1}^k\Big [\big((1+x)^{n_i}-1\big)(1+x)^{|V(H)|}+D(H,x)\Big],\]where each clique \(C_i \in \mathcal{C}\) has \(n_i\)...