Domination in graphoidal covers of a graph

DOI10.1016/S0012-365X(98)00389-6MaRDI QIDQ1304801zbMATH OpenOpenAlexFDO

Authors Purnima Gupta, B. D. 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

independencedominating setdominationindependent setpathgraphoidal cover

Mathematics Subject Classification ID

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

Recommendations

• 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

Cited in

(11)

• Further results on domination in graphoidally covered graphs
• Truly non-trivial graphoidal graphs
• Bounds on 2-point set domination number of a graph
• Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
• On graphs whose graphoidal domination number is one
• Bounds on graphoidal length of a graph
• Domination in graphoidally covered graphs: least-kernel graphoidal covers
• Graphoidally independent infinite graphs
• On graphoidal length of a tree in terms of its diameter
• 2-Point set domination in separable graphs
• Path point cover

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)