Domination in graphoidal covers of a graph

DOI10.1016/S0012-365X(98)00389-6zbMath0933.05113OpenAlexW2047960318MaRDI QIDQ1304801

Purnima Gupta, Belmannu Devadas Acharya

Publication date: 4 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00389-6

zbMATH Keywords

independenceindependent setpathdominating setdominationgraphoidal cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

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 ⋮ Truly non-trivial graphoidal graphs ⋮ 2-Point set domination in separable graphs ⋮ 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

This page was built for publication: Domination in graphoidal covers of a graph