Abstract
The color energy of a graph G is defined as the sum of the absolute values of the color eigenvalues of G. The graphs with large number of edges are referred as cluster graphs. Cluster graphs are obtained from complete graphs by deleting few edges according to some criteria. Bipartite cluster graphs are obtained by deleting few edges from complete bipartite graphs according to some rule. In this paper, we study the color Laplacian energy of cluster graphs and bipartite cluster graphs obtained by deleting the edges of complete and complete bipartite graph respectively.
| Original language | English |
|---|---|
| Pages (from-to) | 247-259 |
| Number of pages | 13 |
| Journal | Turkish World Mathematical Society Journal of Applied and Engineering Mathematics |
| Volume | 12 |
| Issue number | 1 |
| Publication status | Published - 2022 |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Numerical Analysis
- Mathematical Physics
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Mathematics
- Applied Mathematics