Further results on domination in graphoidally covered graphs
From MaRDI portal
Publication:2474660
zbMath1136.05048MaRDI QIDQ2474660
Purnima Gupta, Belmannu Devadas Acharya
Publication date: 6 March 2008
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On graphs whose graphoidal domination number is one ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ 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 point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets ⋮ On graphoidal length of a tree in terms of its diameter ⋮ Graphoidally independent infinite graphs