Upper bounds on the signed edge domination number of a graph
From MaRDI portal
Publication:2214050
DOI10.1016/J.DISC.2020.112201zbMath1454.05081arXiv2001.07955OpenAlexW3093650826WikidataQ112880943 ScholiaQ112880943MaRDI QIDQ2214050
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.07955
Related Items (2)
Algorithms and hardness results for edge total domination problem in graphs ⋮ A conjecture on the lower bound of the signed edge domination number of 2-connected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on several versions of signed domination number
- On the signed edge domination number of graphs
- On signed cycle domination in graphs
- Signed domination in regular graphs and set-systems
- On the signed domination in graphs
- On edge domination numbers of graphs
- Some remarks on domination in cubic graphs
- Signed domination in regular graphs
- Some notes on signed edge domination in graphs
- Two classes of edge domination in graphs
- On signed edge domination numbers of graphs
This page was built for publication: Upper bounds on the signed edge domination number of a graph