Bounds for the Largest Color Eigenvalue and the Color Energy

In [1] Chandrashekar Adiga et al. introduced the matrix of a vertex colored graph and studied their eigenvalues called color eigenvalues. Further, defined the color energy of the graph and obtained some results. In this paper, we obtain bounds for the largest color eigenvalue and the color energy.

Saved in:
Bibliographic Details
Published in:International journal of mathematical combinatorics 2017-03, Vol.1, p.127
Main Author: Sriraj, M A
Format: Article
Language:English
Subjects:
Color
Eigenvalues
Graph theory
Mathematics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In [1] Chandrashekar Adiga et al. introduced the matrix of a vertex colored graph and studied their eigenvalues called color eigenvalues. Further, defined the color energy of the graph and obtained some results. In this paper, we obtain bounds for the largest color eigenvalue and the color energy.
ISSN:1937-1055
1937-1047