Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
Let G=V,E be a connected graph. The resistance distance between two vertices u and v in G, denoted by RGu,v, is the effective resistance between them if each edge of G is assumed to be a unit resistor. The degree resistance distance of G is defined as DRG=∑u,v⊆VGdGu+dGvRGu,v, where dGu is the degree...
Guardado en:
Autores principales: | Wenjie Ning, Kun Wang, Hassan Raza |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Hindawi Limited
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/6d5cf4f563ad46b09bfd0ac39a1a0e3f |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
On Omega Index and Average Degree of Graphs
por: Sadik Delen, et al.
Publicado: (2021) -
On the maximum number of period annuli for second order conservative equations
por: Armands Gritsans, et al.
Publicado: (2021) -
An epistasis and heterogeneity analysis method based on maximum correlation and maximum consistence criteria
por: Xia Chen, et al.
Publicado: (2021) -
On the Study of Reverse Degree-Based Topological Properties for the Third Type of p th Chain Hex-Derived Network
por: Ali N. A. Koam, et al.
Publicado: (2021) -
On the Reformulated Multiplicative First Zagreb Index of Trees and Unicyclic Graphs
por: Akbar Ali, et al.
Publicado: (2021)