EUVIMEDOpdag EUVIMED
Open access · CC BY 4.0

Laplacian Minimum Split Dominating Energy of Graphs

N. Mamatha, S. Purushothama

Boletim da Sociedade Paranaense de Matemática · 2025-09-30 · 43 · 1-11

DOI: 10.5269/bspm.78552 ↗

At a glance

Journal article in Boletim da Sociedade Paranaense de Matemática, published online on 2025-09-30. Written by N. Mamatha and 1 co-authors. 16 references. The full text is freely available (open access, CC BY 4.0).

AbstractBibliografiske oplysningerCiteRelated studies

Abstract (original language)

For a graph $G$, a subset $D$ of $V(G)$ is called a split dominating set if the induced graph $$ is disconnected. The split domination number $\gamma_{s}(G)$ is the minimum cardinality of a split domination set. In this paper we introduce the Laplacian minimum split dominating energy $LE_{s}(G)$ of a graph $G$ and computed Laplacian minimum split dominating energies of some standard graphs. Upper and lower bounds for $LE_{s}(G)$ are established.

Cite

APA

Mamatha, N., & Purushothama, S. (2025). Laplacian Minimum Split Dominating Energy of Graphs. Boletim da Sociedade Paranaense de Matemática, 43, 1-11. https://doi.org/10.5269/bspm.78552

Vancouver

Mamatha N, Purushothama S. Laplacian Minimum Split Dominating Energy of Graphs. Boletim da Sociedade Paranaense de Matemática. 2025;43:1-11. doi:10.5269/bspm.78552

BibTeX
@article{Mamatha2025,
  author = {Mamatha, N. and Purushothama, S.},
  title = {Laplacian Minimum Split Dominating Energy of Graphs},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2025},
  volume = {43},
  pages = {1--11},
  doi = {10.5269/bspm.78552}
}
Start for free →