
Abstract : In this paper, we introduced the concept of Laplacian minimum dominating color energy ofa graph LEcD(G) and compute the Laplacian minimum dominating color energy LEcD(G) of fewfamilies of graphs. Further, the upper and lower bounds for LEcD(G) are established.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
