Domination in graphoidal covers of a graph
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.
- Further results on domination in graphoidally covered graphs
- On graphs whose graphoidal domination number is one
- Domination in graphoidally covered graphs: least-kernel graphoidal covers
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
- Graphoidally independent infinite graphs
- Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
- Further results on domination in graphoidally covered graphs
- On graphs whose graphoidal domination number is one
- Bounds on graphoidal length of a graph
- Domination in graphoidally covered graphs: least-kernel graphoidal covers
- Bounds on 2-point set domination number of a graph
- On graphoidal length of a tree in terms of its diameter
- Graphoidally independent infinite graphs
- Truly non-trivial graphoidal graphs
- Path point cover
- 2-Point set domination in separable graphs
- Graphoidally independent infinite cactus
This page was built for publication: Domination in graphoidal covers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304801)
