@article{Suhas P. Gade_2020, title={Double Domination Number of Subgroup Lattice of a Group}, volume={29}, url={http://sersc.org/journals/index.php/IJAST/article/view/24461}, abstractNote={<p><em>A subgroup lattice </em> <em>&nbsp;is a diagram that includes all the subgroups of the&nbsp; group </em> <em>&nbsp;and then if </em> <em>&nbsp;and </em> <em>&nbsp;are subgroups of </em> <em>&nbsp;with </em> <em>&nbsp;and there is no subgroup </em> <em>&nbsp;such that </em> <em>, then </em> <em>&nbsp;appear above </em> <em>&nbsp;and a segment is drawn connecting </em> <em>&nbsp;and </em> <em>. The graph of subgroups lattice is denoted by </em> <em>. A subset </em> <em>&nbsp;of </em> <em>&nbsp;is double dominating set of </em> <em>&nbsp;if for every vertex </em> <em>, </em> <em>, that is </em> <em>&nbsp;in </em> <em>&nbsp;and has at least one neighbour in </em> <em>&nbsp;or </em> <em>&nbsp;and has at least two neighbours in </em> <em>. The double domination number </em> <em>&nbsp;in subgroup lattice </em> <em>&nbsp;is a minimum cardinality of double dominating set. In this paper some upper and sharp bounds on </em> <em>&nbsp;are obtained &nbsp;</em></p&gt;}, number={12s}, journal={International Journal of Advanced Science and Technology}, author={Suhas P. Gade}, year={2020}, month={Jun.}, pages={2330 - 2341} }