Color energy of a graph

MaRDI QIDQ5407538zbMATH OpenFDO

Authors Chandrashekar Adiga, E. Sampathkumar, M. A. Sriraj, A. S. Shrikanth

Publication date 7 April 2014

zbMATH Keywords

color adjacency matrixcolor eigenvaluescolor energy

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Further results on color energy of graphs
• Цветовая энергия некоторых кластерных графов
• Color Laplacian energy of a graph
• Color signless Laplacian energy of graphs
• Vertex-vertex color energy of a graph

Cited in

(19)

• Further results on color energy of graphs
• Decision-making approaches based on color spectrum and D-TOPSIS method under rough environment
• \( \mathcal{P} \)-energy of graphs
• Vertex-vertex color energy of a graph
• Color signless Laplacian energy of graphs
• Color Laplacian energy of a graph
• Partition Laplacian energy of a graph
• The block energy of a graph
• Color energy of a unitary Cayley graph
• On spectrum of a graph given by color Harary matrix
• Цветовая энергия некоторых кластерных графов
• Minimum independent dominating energy of graphs
• Bounds on Randić color energy of a graph
• New results on color energy of graphs
• Certain types of minimum covering Estrada index of graphs
• Analyzing pathway energy and time complexity in flower families through vertex-disjoint paths
• Partition energy of m-splitting graph and their generalized complements
• The cordial energy of some graphs
• Path energy bounds for hub-centric graphs of order 2n + 1 with algorithmic computation

This page was built for publication: Color energy of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5407538)