Some bounds for the signed edge domination number of a graph
From MaRDI portal
Publication:2875482
zbMATH Open1296.05143MaRDI QIDQ2875482FDOQ2875482
Authors: S. Akbari, H. Esfandiari, E. Barzegary, S. Seddighin
Publication date: 15 August 2014
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/58/ajc_v58_p060.pdf
Recommendations
Cited In (9)
- Signed edge majority domination numbers in graphs
- Some notes on signed edge domination in graphs
- Title not available (Why is that?)
- A conjecture on the lower bound of the signed edge domination number of 2-connected graphs
- Upper bounds on the signed edge domination number of a graph
- The signed edge-domatic number of nearly cubic graphs
- On signed edge domination numbers of graphs
- On the minimal sum of edges in a signed edge-dominated graph
- New bounds on the signed domination numbers of graphs
This page was built for publication: Some bounds for the signed edge domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875482)