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

DOI10.1142/S1793830920500020zbMath1433.05253OpenAlexW2980191355WikidataQ127150754 ScholiaQ127150754MaRDI QIDQ5216440

R. S. Bhat, Sayinath Udupa

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)

Related Items (4)

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

Cites Work

• On strong (weak) independent sets and vertex coverings of a graph
• Strong weak domination and domination balance in a graph
• RELATIONSHIP BETWEEN BLOCK DOMINATION PARAMETERS OF A GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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