A conjecture on the lower bound of the signed edge domination number of 2-connected graphs

DOI10.1016/J.DAM.2021.06.003zbMath1469.05130OpenAlexW3176475105WikidataQ113877231 ScholiaQ113877231MaRDI QIDQ2043354

Yanyan Li

Publication date: 2 August 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.06.003

zbMATH Keywords

dominationsigned edge domination functionsigned edge domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Signed and weighted graphs (05C22)

Cites Work

• On edge domination numbers of graphs
• Upper bounds on the signed edge domination number of a graph
• Some notes on signed edge domination in graphs
• On signed edge domination numbers of graphs

This page was built for publication: A conjecture on the lower bound of the signed edge domination number of 2-connected graphs