Laplacian Minimum Equitable Dominating Partition Energy of a Graph
Boletim da Sociedade Paranaense de Matemática · 12.11.2026 · 44 · 1-11
DOI: 10.5269/bspm.86145 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 12.11.2026. Verfasst von Monisha S. und 2 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let $G$ be any graph of order $n$ with vertex set $V(G)=\{v_1,v_2,...,v_n\}$ and edge set $E$. A subset $S$ of $V(G)$ is an equitable dominating set if for every $v \in V(G)-S$ there exists a vertex $u \in S$ such that $uv \in E(G)$ and $\mid deg(u)- deg(v) \mid \le 1$ where $deg(u)$ denotes the degree of vertex $u$ in $V(G)$. Any equitable dominating set with minimum cardinality is called a minimum equitable dominating set. In this paper, we compute define and study the Laplacian minimum equitable dominating partition energy of some standard graphs.
Zitieren
APA
S., M., Shivashankara, K., & R., K. K. (2026). Laplacian Minimum Equitable Dominating Partition Energy of a Graph. Boletim da Sociedade Paranaense de Matemática, 44, 1-11. https://doi.org/10.5269/bspm.86145
Vancouver
S. M, Shivashankara K, R. KK. Laplacian Minimum Equitable Dominating Partition Energy of a Graph. Boletim da Sociedade Paranaense de Matemática. 2026;44:1-11. doi:10.5269/bspm.86145
BibTeX
@article{S2026,
author = {S., Monisha and Shivashankara, K. and R., Karthik K.},
title = {Laplacian Minimum Equitable Dominating Partition Energy of a Graph},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
volume = {44},
pages = {1--11},
doi = {10.5269/bspm.86145}
}
EUVIMED