On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise. Assume that D(G) is the n×n diagonal matrix whose (i,i)-entry is the degree of v_i. The matr...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
OICC Press
2022-06-01
|
| Series: | Fuzzy Optimization and Modeling |
| Acceso en liña: | https://oiccpress.com/fomj/article/view/6470 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|