| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 690 26 |
| Ultima descărcare din IBN: 2024-04-07 03:11 |
| Căutarea după subiecte similare conform CZU |
| 519.17 (68) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012JAHANBANI, Akbar. New Bounds for the Harmonic Energy and Harmonic Estrada index of Graphs. In: Computer Science Journal of Moldova, 2018, nr. 3(78), pp. 270-300. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(78) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.17 | ||||||
| Pag. 270-300 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Let G be a finite simple undirected graph with n vertices and m edges. The Harmonic energy of a graph G, denoted by HE(G), is defined as the sum of the absolute values of all Harmonic eigenvalues of G. The Harmonic Estrada index of a graph G, denoted by HEE(G), is defined as HEE = HEE(G) =∑Pn i=1 ei , where 1 > 2 > · · · > n are the H-eigenvalues of G. In this paper we present some new bounds for HE(G) and HEE(G) in terms of number of vertices, number of edges and the sum-connectivity index. |
||||||
| Cuvinte-cheie Eigenvalue of graph, sum-connectivity index, Harmonic energy, Harmonic Estrada index., energy |
||||||
|
|
|
|
