On the n-dominating graph of specific graphs

MaRDI QIDQ6255222zbMATH OpenFDO

Authors Saeid Alikhani, Davood Fatehi

Publication date 5 October 2014

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Let $G=(V,E)$ be a graph. A set $SsubseteqV(G)$ is a dominating set, if every vertex in $$ is adjacent to at least one vertex in $S$. The $k$-dominating graph of $G$, $D_k(G)$, is defined to be the graph whose vertices correspond to the dominating sets of $G$ that have cardinality at most $k$. Two vertices in $D_k(G)$ are adjacent if and only if the corresponding dominating sets of $G$ differ by either adding or deleting a single vertex. In this paper we consider and study the $n$-dominating graph of specific graphs.

This page was built for publication: On the $n-$dominating graph of specific graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6255222)