Laplacian minimum boundary dominating energy of graphs (Q345205): Difference between revisions

Summary: For a graph \(G\), a subset \( B \) of \( V(G) \) is called a boundary dominating set if every vertex of \( V(G)- B \) is vertex boundary dominated by some vertex of \( B \). The boundary domination number \(\gamma_{b}(G)\) of \(G\) is the minimum cardinality of minimum boundary dominating set in \(G\). In this paper we computed Laplacian minimum boundary dominating energies of some standard graphs. Upper and lower bounds for \(\mathrm{LE}_{B}(G)\) are established.