Graphs and matrices with maximal energy (Q860609): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2108520037 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0603725 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250381 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3907599 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4186355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal energy graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The energy of graphs and matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the energy of some circulant graphs / rank | |||
Normal rank |
Latest revision as of 12:10, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphs and matrices with maximal energy |
scientific article |
Statements
Graphs and matrices with maximal energy (English)
0 references
9 January 2007
0 references
To any graph \(G\) was defined and studied the function \(\varepsilon(G)\), the so-called energy of a graph \(G\). The author defines a new modification of the function \(\varepsilon(G)\) and proves that for all sufficienty large \(n\), there exists a graph \(G\) with \(n\) vertices such that \(\varepsilon(G)\geq {n^{3/2}\over 2}- n^{n/10}\). From that statement follows the conjecture of Koolen and Moulton. At the end the author characterizes all graphs with energy close to the maximal one.
0 references
graph energy
0 references
maximal energy graphs
0 references
matrix energy
0 references