Tricyclic biregular graphs whose energy exceeds the number of verticesReport as inadecuate




Tricyclic biregular graphs whose energy exceeds the number of vertices - Download this document for free, or read online. Document in PDF available to download.

Mathematical Communications, Vol.15 No.1 June 2010. -

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. The energy $EG$ of the graph $G$ is the sum of the absolute values of the eigenvalues of $G$. A graph is said to be $a,b$-biregular if its vertex degrees assume exactly two different values: a and b. A connected graph with $n$ vertices and $m$ edges is tricyclic if m=n+2. The inequality $EG\geq n$ is studied for connected tricyclic biregular graphs, and conditions for its validity are established.

energy of a graph; biregular graph; tricyclic graph



Author: Snježana Majstorović - ; Department of Mathematics, University of Osijek,Osijek, Croatia Ivan Gutman - ; Faculty of Science, Un

Source: http://hrcak.srce.hr/



DOWNLOAD PDF




Related documents