Minimum covering color Laplacian energy of a graph

Minimum covering color Laplacian energy of a graph

In this paper, we introduced the concept of minimum covering color Laplacian energy LEχC(G) of a graph G and computed minimum covering chromatic Laplacian energies of star graph, complete graph, crown graph, bipartite graph and cocktail graphs. Upper and lower bounds for LEcC(G) are also established...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kumar, R. Pradeep, Kanna, M. R. Rajesh
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Color
Graph theory
Lower bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we introduced the concept of minimum covering color Laplacian energy LEχC(G) of a graph G and computed minimum covering chromatic Laplacian energies of star graph, complete graph, crown graph, bipartite graph and cocktail graphs. Upper and lower bounds for LEcC(G) are also established.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0016786