On graphs whose graphoidal domination number is one

DOI10.1016/J.AKCEJ.2015.11.007MaRDI QIDQ321997zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

\(\psi\)-dominationgraphoidal covergraphoidally covered graph

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Domination in graphoidal covers of a graph
• Further results on domination in graphoidally covered graphs
• Graphoidal covers and graphoidal covering number of a graph
• Parallel concepts in graph theory

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
• scientific article; zbMATH DE number 5943498 (Why is no real title available?)
• Path point cover
• scientific article; zbMATH DE number 6289202 (Why is no real title available?)

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)