Published 2025
| Version v1
Journal
Open
Laplacian Minimum Dominating Color Energy Of A Graph
Creators
Description
Abstract :
In this paper, we introduced the concept of Laplacian minimum dominating color energy of
a graph LEcD(G) and compute the Laplacian minimum dominating color energy LEcD(G) of few
families of graphs. Further, the upper and lower bounds for LEcD(G) are established.
Files
6.FJ25C583.pdf
Files
(305.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:ab549ef67f2e405a9f3259bbb58dea98
|
305.7 kB | Preview Download |