Domination in graphoidal covers of a graph (Q1304801): Difference between revisions

The concept of graphoidal cover was introduced by B. D. Acharya and E. Sampathkumar. A graphoidal cover of a graph \(G\) is a family \(\psi\) of paths in \(G\) (not necessarily open) such that each edge of \(G\) belongs to exactly one path from \(\psi\). The paper develops the theory of \(\psi\)-independence and \(\psi\)-domination. Two vertices of \(G\) are \(\psi\)-adjacent, if there exists a path from \(\psi\) which connects them. A set \(S\) of vertices of \(G\) such that no two of its vertices are \(\psi\)-adjacent is called \(\psi\)-independent. A set \(S\) such that each vertex of \(G\) either is in \(S\) or is \(\psi\)-adjacent to a vertex of \(S\), is called as \(\psi\)-dominating set in \(G\). The properties of these concepts are studied.