Domination in graphoidally covered graphs: least-kernel graphoidal covers

DOI10.1016/j.endm.2016.05.037zbMath1347.05142OpenAlexW2509140350MaRDI QIDQ327691

Rajesh Singh, Purnima Gupta

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.037

zbMATH Keywords

graphoidal covergraphoidal dominationindependent domination

Mathematics Subject Classification ID

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 (1)

Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On domination and independent domination numbers of a graph
• Introduction to ``Topics on Domination
• Graphoidal covers and graphoidal covering number of a graph
• Domination in graphoidal covers of a graph
• Further results on domination in graphoidally covered graphs

This page was built for publication: Domination in graphoidally covered graphs: least-kernel graphoidal covers