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

DOI10.1016/J.DISC.2006.07.040zbMATH Open1113.05082OpenAlexW2000920682MaRDI QIDQ870977FDOQ870977

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

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

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)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Complementary Graphs
• Strong weak domination and domination balance in a graph
• Title not available (Why is that?)
• On parameters related to strong and weak domination in graphs
• On weak domination in graphs
• Partial signed domination in graphs

Cited In (5)

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

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)