1403/01/09
دوستعلی مژده

دوستعلی مژده

مرتبه علمی: استاد
ارکید:
تحصیلات: دکترای تخصصی
اسکاپوس:
دانشکده: دانشکده علوم ریاضی
نشانی:
تلفن: 011-35302448

مشخصات پژوهش

عنوان
Connected domination polynomial of graphs
نوع پژوهش
JournalPaper
کلیدواژه‌ها
connected domination polynomial, graphs, connected dominating set, Petersen graphs.
سال
2018
مجله Fasciculi Mathematici
شناسه DOI
پژوهشگران Doost Ali Mojdeh ، Azam Sadat Emadi

چکیده

Let $G$ be a simple graph of order $n$. The connected domination polynomial of $G$ is the polynomial $D_{c}(G, x)=\sum_{i=\gamma_{c}(G)}^{|V(G)|}d_{c}(G, i)x^i$, where $d_{c}(G, i)$ is the number of connected dominating sets of $G$ of size $i$ and $\gamma_{c}(G)$ is the connected domination number of $G$. In this paper we study $D_{c}(G, x)$ of any graph. We classify many families of graphs by studying their connected domination polynomial.