Some relations between rank, chromatic number and energy of graphs

DOI10.1016/J.DISC.2008.09.012MaRDI QIDQ1011502zbMATH OpenOpenAlexFDO

Authors S. Akbari, E. Ghorbani, S. Zare

Publication date 8 April 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0709.3140

zbMATH Keywords

energyrankchromatic number

Mathematics Subject Classification ID

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

Abstract: The energy of a graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. Let $G$ be a graph of order $n$ and $mrank(G)$ be the rank of the adjacency matrix of $G$. In this paper we characterize all graphs with $E(G)=mrank(G)$. Among other results we show that apart from a few families of graphs, $$, where $n$ is the number of vertices of $G$, $$ and $chi(G)$ are the complement and the chromatic number of $G$, respectively. Moreover some new lower bounds for $E(G)$ in terms of $mrank(G)$ are given.

Recommendations

• Choice number and energy of graphs
• Energy of nonsingular graphs: improving lower bounds
• Energy, matching number and rank of graphs
• scientific article; zbMATH DE number 7410313
• A new lower bound for the energy of graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 4173028 (Why is no real title available?)
• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3253789 (Why is no real title available?)
• Energy ordering of catacondensed hexagonal systems
• On Complementary Graphs
• On the maximal energy and the Hosoya index of a type of trees with many pendant vertices
• On the minimal energy of trees with a given diameter
• Polygonal chains with minimal energy
• Recent results in the theory of graph spectra
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• The energy of a graph

Cited in

(19)

• Choice number and energy of graphs
• Energy, matching number and odd cycles of graphs
• A lower bound for the energy of graphs in terms of the vertex cover number
• Lower bounds of graph energy in terms of matching number
• Some relations among term rank, clique number and list chromatic number of a graph
• On bounds for the energy of graphs and digraphs
• Rank, term rank and chromatic number of a graph
• Maximal energy of subdivisions of graphs with a fixed chromatic number
• Relation between the skew energy of an oriented graph and its matching number
• Generating new test instances by evolving in instance space
• A new conjecture on the inertia of graphs
• Energies of hypergraphs
• On the energy of graphs
• Remarks on the bounds of graph energy in terms of vertex cover number or matching number.
• Some lower bounds for the energy of graphs in terms of spread of matrix
• Upper bound of skew energy of an oriented graph in terms of its skew rank
• Bounds of graph energy in terms of vertex cover number
• Upper bounds of the energy of triangle-free graphs in terms of matching number
• The bounds of the energy and Laplacian energy of chain graphs

Describes a project that uses

Uses Software

• GRAFFITI

This page was built for publication: Some relations between rank, chromatic number and energy of graphs

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