Laplacian Minimum Nonsplit Dominating Energy of Graphs
Boletim da Sociedade Paranaense de Matemática · 12.11.2026 · 44 · 1-13
DOI: 10.5269/bspm.86858 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 12.11.2026. Verfasst von Rashmi und 3 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
For a graph $G$, a subset $D$ of $V(G)$ is called a nonsplit dominating set if the induced graph $$ is connected. The nonsplit domination number $\gamma_{s}(G)$ is the minimum cardinality of a nonsplit domination set. In this paper we introduce the Laplacian minimum nonsplit dominating energy $LE_{ns}(G)$ of a graph $G$ and computed Laplacian minimum nonsplit dominating energies of some standard graphs. Upper and lower bounds for $LE_{ns}(G)$ are established.
Zitieren
APA
Rashmi, V., D. R. S., C., A. H., & Patil, A. N. (2026). Laplacian Minimum Nonsplit Dominating Energy of Graphs. Boletim da Sociedade Paranaense de Matemática, 44, 1-13. https://doi.org/10.5269/bspm.86858
Vancouver
Rashmi, V. DRS, C. AH, Patil AN. Laplacian Minimum Nonsplit Dominating Energy of Graphs. Boletim da Sociedade Paranaense de Matemática. 2026;44:1-13. doi:10.5269/bspm.86858
BibTeX
@article{Rashmi2026,
author = {Rashmi and V., Divya Rashmi S. and C., Abhilash H. and Patil, Anuradha N.},
title = {Laplacian Minimum Nonsplit Dominating Energy of Graphs},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
volume = {44},
pages = {1--13},
doi = {10.5269/bspm.86858}
}
EUVIMED