Signed mixed dominating functions in complete bipartite graphs

DOI10.1080/00207160.2014.920832zbMath1321.05189OpenAlexW2002597511MaRDI QIDQ5259070

Erfang Shan, Yan-Cai Zhao

Publication date: 24 June 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.920832

zbMATH Keywords

signed dominationsigned mixed dominating functionsigned mixed domination number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Factorials, binomial coefficients, combinatorial functions (05A10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Signed mixed Roman domination numbers in graphs ⋮ On the complexity of variations of mixed domination on graphs^†

Cites Work

• Unnamed Item
• The algorithmic complexity of mixed domination in graphs
• Signed total \((k,k)\)-domatic number of digraphs
• On total matching numbers and total covering numbers of complementary graphs
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• On the mixed domination problem in graphs
• A lower bound on the total signed domination numbers of graphs
• Signed Total Domination Nnumber of a Graph
• SIGNED TOTAL κ-DOMATIC NUMBERS OF GRAPHS
• Total matchings and total coverings of graphs

This page was built for publication: Signed mixed dominating functions in complete bipartite graphs