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

DOI10.1016/J.DISC.2008.03.003MaRDI QIDQ1024508zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• On signed edge domination numbers of graphs

Cited in

(8)

• On the characterization of maximal planar graphs with a given signed cycle domination number
• Signed edge domination numbers in trees
• On signed edge domination numbers of trees
• On the trees with same signed edge and signed star domination numbers
• On signed edge domination numbers of graphs
• Signed edge domination number of interval graphs
• Some notes on signed edge domination in 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)