On strong (weak) independent sets and vertex coverings of a graph

DOI10.1016/J.DISC.2006.07.040MaRDI QIDQ870977zbMATH OpenOpenAlexFDO

Authors S. S. Kamath, R. S. Bhat

Publication date 15 March 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.07.040

zbMATH Keywords

strong (weak) vertex coverstrong (weak) vertices

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1506495
• Independent and vertex covering number on strong product of complete graphs
• Strong-weak domatic numbers of graphs
• On strong and weak domination numbers in graphs
• scientific article; zbMATH DE number 4029614

Cites work

• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3221976 (Why is no real title available?)
• Graph theory with applications
• On Complementary Graphs
• On parameters related to strong and weak domination in graphs
• On weak domination in graphs
• Partial signed domination in graphs
• Strong weak domination and domination balance in a graph

Cited in

(5)

• On locally optimal independent sets and vertex covers
• Strong vb-dominating and vb-independent sets of a graph
• Strong and weak edges of a graph and linkages with the vertex cover problem
• Relationship between block domination parameters of a graph
• On vertex types of graphs

This page was built for publication: On strong (weak) independent sets and vertex coverings of a graph

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