On Congruent Domination Number of Disjoint and One Point Union of Graphs

DOI10.22342/JIMS.28.3.1102.251-258zbMATH Open1504.05225OpenAlexW4313644288MaRDI QIDQ5876937FDOQ5876937

Authors: S. K. Vaidya, H. D. Vadhel 

Publication date: 3 February 2023

Published in: Journal of the Indonesian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22342/jims.28.3.1102.251-258

Recommendations

• scientific article; zbMATH DE number 1714662
• scientific article; zbMATH DE number 1456834
• Threshold Decoding
• Which codes have cycle-free Tanner graphs?
• Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A

zbMATH Keywords

domination numberdominating setcongruent dominating setcongruent domination number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Total domination in graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• Degree equitable domination on graphs

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On Congruent Domination Number of Disjoint and One Point Union of Graphs

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