Strong vb-dominating and vb-independent sets of a graph

DOI10.1142/S1793830920500020MaRDI QIDQ5216440zbMATH OpenOpenAlexWikidataFDO

Authors Sayinath Udupa, R. S. Bhat

Publication date 18 February 2020

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830920500020

zbMATH Keywords

strong vertex-block dominating setsstrong vertex-block independent sets

Mathematics Subject Classification ID

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

Recommendations

• Relationship between block domination parameters of a graph
• The minimum vertex-block dominating energy of the graph
• Strong weak domination and domination balance in a graph
• Strong-weak domatic numbers of graphs
• On strong and weak domination numbers in graphs

Cites work

• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1151808 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3221976 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Mixed block domination in graphs
• On strong (weak) independent sets and vertex coverings of a graph
• On weak domination in graphs
• Relationship between block domination parameters of a graph
• Strong weak domination and domination balance in a graph

Cited in

(6)

• Vertex-vertex color energy of a graph
• Relationship between block domination parameters of a graph
• The minimum vertex-block dominating energy of the graph
• Clique doubly connected domination in the join and lexicographic product of graphs
• The minimum vertex–vertex dominating Laplacian energy of a graph
• Line-set domination in graphs

This page was built for publication: Strong vb-dominating and vb-independent sets of a graph

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