On maximum signless Laplacian Estrada index of graphs with given parameters II
<p>The signless Laplacian Estrada index of a graph <span class="math"><em>G</em></span> is defined as <span class="math"><em>S</em><em>L</em><em>E</em><em>E</em>(<em>G</em>) = ∑<sup><em>n</em></sup><sub><em>i</em> = 1</sub><em>e</em><sup><em>q</em><sub><em>i</em></sub></sup></span> where <span class...
Guardat en:
| Autors principals: | , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
| Col·lecció: | Electronic Journal of Graph Theory and Applications |
| Matèries: | |
| Accés en línia: | http://www.ejgta.org/index.php/ejgta/article/view/261 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|