On the spectral radius and energy of the degree distance matrix of a connected graph
Let GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is defined as the length of the shortest path from...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
De Gruyter
2025-04-01
|
| Col·lecció: | Open Mathematics |
| Matèries: | |
| Accés en línia: | https://doi.org/10.1515/math-2025-0139 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|