On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4
From MaRDI portal
Publication:1024508
DOI10.1016/J.DISC.2008.03.003zbMATH Open1190.05049OpenAlexW2014346131MaRDI QIDQ1024508FDOQ1024508
Authors: Xiao Ming Pi, Huanping Liu 
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.003
Recommendations
- On signed edge domination numbers of trees
- Signed edge domination numbers in trees
- On the trees with same signed edge and signed star domination numbers
- On the signed edge domination number of graphs
- On the signed star domination numbers of trees.
- On signed edge domination numbers of graphs
- On signed edge total domination numbers of graphs
- scientific article; zbMATH DE number 6001801
- Signed edge \(k\)-domination numbers in graphs
- A note on the signed edge domination number in graphs
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (8)
- On signed edge domination numbers of trees
- Some notes on signed edge domination in graphs
- On the characterization of maximal planar graphs with a given signed cycle domination number
- On signed edge domination numbers of graphs
- Signed edge domination numbers in trees
- On the trees with same signed edge and signed star domination numbers
- Signed edge domination number of interval graphs
- On the complexity of variations of mixed domination on graphs
This page was built for publication: On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024508)
