Domination in graphoidally covered graphs: least-kernel graphoidal covers

DOI10.1016/J.ENDM.2016.05.037MaRDI QIDQ327691zbMATH OpenOpenAlexFDO

Authors Purnima Gupta, Rajesh Singh

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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
• Further results on domination in graphoidally covered graphs
• Domination in graphoidal covers of a graph
• On graphs whose graphoidal domination number is one
• Graphoidally independent infinite graphs

Cites work

• A note on idependent domination in graphs
• Domination in graphoidal covers of a graph
• Further results on domination in graphoidally covered graphs
• Graphoidal covers and graphoidal covering number of a graph
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Introduction to ``Topics on Domination
• On domination and independent domination numbers of a graph

Cited in

(3)

• Domination in graphoidal covers of a graph
• Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
• Further results on domination in graphoidally covered graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327691)