A note on the lower bounds of signed domination number of a graph
From MaRDI portal
Publication:1296996
DOI10.1016/S0012-365X(98)00189-7zbMath0928.05052OpenAlexW1978524950MaRDI QIDQ1296996
Linzhong Liu, Bao-Gen Xu, Yin-zhen Li, Zhong Fu Zhang
Publication date: 9 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00189-7
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items
Twin signed double Roman domination numbers in directed graphs ⋮ The signed \(k\)-domination number of directed graphs ⋮ Signed Roman domination in graphs ⋮ Signed total domination in graphs. ⋮ On the signed star domination number of regular multigraphs ⋮ A lower bound on the total signed domination numbers of graphs ⋮ Lower bounds on several versions of signed domination number ⋮ Two classes of edge domination in graphs ⋮ Lower negative decision number in a graph ⋮ Discrepancy and signed domination in graphs and hypergraphs ⋮ On edge domination numbers of graphs ⋮ The signed star domination numbers of the Cartesian product graphs ⋮ Signed Roman \(k\)-domination in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ On signed cycle domination in graphs ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Upper signed \(k\)-domination in a general graph ⋮ Unnamed Item ⋮ Signed domination numbers of a graph and its complement ⋮ On the nonnegative signed domination numbers in graphs ⋮ Signed Roman \(k\)-domination in trees ⋮ Twin signed k-domination numbers in directed graphs ⋮ On the trees with same signed edge and signed star domination numbers
Cites Work
