Minimum Nonsplit Dominating Signless Laplacian Graph Energy
Boletim da Sociedade Paranaense de Matemática · 27.10.2026 · 44 · 1-13
DOI: 10.5269/bspm.85429 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 27.10.2026. Verfasst von Asha S. P. und 2 weiteren Autor:innen. Die Arbeit nennt 18 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_{ns}(G)$ is the minimum cardinality of a nonsplit domination set. In this paper we introduce the concept of minimum nonsplit dominating signless Laplacian graph energy $LE_{ns}^{+}(G)$ of a graph $G$ and computed minimum nonsplit dominating signless Laplacian graph energies of some standard graphs. Upper and lower bounds for $LE_{ns}^{+}(G)$ are established.
Zitieren
APA
P., A. S., Manjunatha, M., & R., K. K. (2026). Minimum Nonsplit Dominating Signless Laplacian Graph Energy. Boletim da Sociedade Paranaense de Matemática, 44, 1-13. https://doi.org/10.5269/bspm.85429
Vancouver
P. AS, Manjunatha M, R. KK. Minimum Nonsplit Dominating Signless Laplacian Graph Energy. Boletim da Sociedade Paranaense de Matemática. 2026;44:1-13. doi:10.5269/bspm.85429
BibTeX
@article{P2026,
author = {P., Asha S. and Manjunatha, M. and R., Karthik K.},
title = {Minimum Nonsplit Dominating Signless Laplacian Graph Energy},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
volume = {44},
pages = {1--13},
doi = {10.5269/bspm.85429}
}
EUVIMED