Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
688 2 |
Ultima descărcare din IBN: 2019-02-28 20:17 |
Căutarea după subiecte similare conform CZU |
519.8 (171) |
Исследование операций (168) |
SM ISO690:2012 NILANJAN, De. Vertex weighted Laplacian Energy of union of graphs. In: Computer Science Journal of Moldova, 2018, nr. 1(76), pp. 29-38. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(76) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.8 | ||||||
MSC 2010: 05C05 | ||||||
Pag. 29-38 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The vertex weighted Laplacian energy with respect to the vertex weight w of a graph G with n vertices is defined as LEw(G) = Sum (i=1=>n) |μi − ¯ w|, where μ1, μ2, ..., μn are the Laplacian eigenvalues of G and ¯ w is the average value of the weight w. In this paper, we derive upper and lower bounds of weighted Laplacian energy of union of k-number of connected disjoint graphs G1, G2,...,Gk and hence consider some particular cases. |
||||||
Cuvinte-cheie Eigenvalue, Energy (of graph), Laplacian energy, Topological index. |
||||||
|