On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4

DOI10.1016/J.DISC.2008.03.003zbMath1190.05049OpenAlexW2014346131MaRDI QIDQ1024508

Huan Ping Liu, Xiao Ming Pi

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

zbMATH Keywords

graphsigned edge domination functionsigned edge domination number

Mathematics Subject Classification ID

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

Related Items (3)

On the characterization of maximal planar graphs with a given signed cycle domination number ⋮ On the complexity of variations of mixed domination on graphs^† ⋮ On the trees with same signed edge and signed star domination numbers

Cites Work

• On signed edge domination numbers of graphs

This page was built for publication: On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4