Pendant Domination Polynomial of the Corona of a Wheel and an Independent Graph
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Let WM be the wheel graph on M ≥ 4 vertices and let Kn be the independent graph on n ≥ 1 vertices. We study the corona product WM ◦ Kn and obtain an explicit formula for its pendant domination polynomial. The computation starts from the domination polynomial and subtracts a correction term that counts dominating sets whose induced subgraph contains no vertex of degree 1. For the wheel, the correction term reduces to counting subsets of the rim cycle for which the selected rim vertices are not isolated on the rim. We also determine the pendant domination number for this family.
Fields of Study & Subjects
Graph theory and applications
Advanced Graph Theory Research
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- Annals of Communications in Mathematics
- Publication date
- 28 March 2026
- Language
- EN