Abstract
The domination number γ(G) of a graph G is the least number of vertices in a dominating set of G, and the lower irredundance number ir(G) is the least number of vertices in a maximal irredundant set of G. For each of these graph parameters, we establish bounds on the parameter of the coalescence of two graphs in terms of the parameters of the two respective graphs. These results are then utilised in the construction of graphs that are γ-critical but not ir-critical. Such graphs were not previously known to exist.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
