On graphs whose graphoidal domination number is one

DOI10.1016/J.AKCEJ.2015.11.007zbMATH Open1346.05222OpenAlexW2209991604MaRDI QIDQ321997FDOQ321997

Authors: Purnima Gupta, Deepti Jain, B. D. Acharya 

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2015.11.007

Recommendations

• Further results on domination in graphoidally covered graphs
• Domination in graphoidal covers of a graph
• A note on the graphoidal covering number of a graph
• On graphoidal graphs
• The graphoidal covering number of unicyclic graphs

zbMATH Keywords

\(\psi\)-dominationgraphoidal covergraphoidally covered graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• Graphoidal covers and graphoidal covering number of a graph
• Domination in graphoidal covers of a graph
• Further results on domination in graphoidally covered graphs

Cited In (6)

• Further results on domination in graphoidally covered graphs
• Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
• Domination in graphoidally covered graphs: least-kernel graphoidal covers
• Title not available (Why is that?)
• Path point cover
• Title not available (Why is that?)

This page was built for publication: On graphs whose graphoidal domination number is one

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