9 March 2023 in Process Safety and Environmental Protection
1 May 2023 in Journal of the Franklin Institute
20 December 2023 in The Canadian Journal of Chemical Engineering
18 September 2023 in Communications in Mathematics and Applications
In this article, our aim is to determine the pendant total domination polynomial of some families of standard graphs and obtain some properties of coefficients and nullity of the pendant total domination polynomial of a connected graph \(\mathcal{G}\). Consider \(\mathcal{G}\) as a simple connected graph and its vertex and edge sets are defined as \(\mathcal{V}_\calG\) and \(\mathcal{E}_\calG\), respectively. A set \(\mathcal{T} \subseteq \mathcal{V}_\calG\) is said to be a total dominating set of graph \(\mathcal{G}\) if all the vertices of the graph must attached with some vertex of \(\mathcal{T} \). A set \(\mathcal{T} \subseteq \mathcal{V}_\calG\) is said to be a PTDS if \(\mathcal{T}\) is a TDS and \(\langle \mathcal{T} \rangle\) contains at least a single pendant vertex.
24 May 2024 in Communications in Mathematics and Applications
The purpose of this article is to illustrate the concept of regular domination on a variety of unique graph types, including complete graphs, path graphs, cycle graphs, lollipop graphs, barbell graphs, gear graphs, Petersen graphs, helm graphs, jellyfish graphs, jewel graphs, and complete bipartite graphs. We also determine the regular domination for specific operations, such as the join of two graphs and the corona product of two graphs.