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

DOI10.1016/J.AKCEJ.2018.01.002zbMath1390.05164OpenAlexW2789218008MaRDI QIDQ1643914

Rajesh Singh, Purnima Gupta

Publication date: 20 June 2018

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.2018.01.002

zbMATH Keywords

dominationgraphoidal coverleast-kernel graphoidal cover

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs whose graphoidal domination number is one
• Domination in graphoidally covered graphs: least-kernel graphoidal covers
• On domination and independent domination numbers of a graph
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Graphoidal covers and graphoidal covering number of a graph
• On the graphoidal covering number of a graph
• Domination in graphoidal covers of a graph
• Graphoidal bipartite graphs
• Graphs with unique minimum graphoidal cover
• Acyclic graphoidal covers and path partitions in a graph
• Further results on domination in graphoidally covered graphs
• Graphs whose acyclic graphoidal covering number is one less than its maximum degree

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