Two classes of edge domination in graphs
From MaRDI portal
Publication:2492229
DOI10.1016/j.dam.2005.12.007zbMath1091.05055OpenAlexW2091945690MaRDI QIDQ2492229
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.12.007
signed edge domination functionsigned edge domination numberlocal signed edge domination functionlocal signed edge domination number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (21)
THE SIGNED STAR DOMINATION NUMBER OF CAYLEY GRAPHS ⋮ On the algorithmic complexity of edge total domination ⋮ Signed star (k,k)-domatic number of a graph ⋮ Maximal matching and edge domination in complete multipartite graphs ⋮ On the mixed minus domination in graphs ⋮ On the complexity of variations of mixed domination on graphs† ⋮ Algorithms and hardness results for edge total domination problem in graphs ⋮ Unnamed Item ⋮ Upper bounds on the signed edge domination number of a graph ⋮ A note on the signed edge domination number in graphs ⋮ Signed star domatic number of a graph ⋮ The complexity of total edge domination and some related results on trees ⋮ Complexity and characterization aspects of edge-related domination for graphs ⋮ Signed Roman edge domination numbers in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ A comment to: Two classes of edge domination in graphs ⋮ Signed Stark-subdomination numbers in graphs ⋮ On the signed edge domination number of graphs ⋮ Upper signed \(k\)-domination in a general graph ⋮ On the balanced domination of graphs ⋮ Signed star (j, k)-domatic numbers of digraphs
Cites Work
This page was built for publication: Two classes of edge domination in graphs
