On Average Distance of Neighborhood Graphs and Its Applications
Graph invariants such as distance have a wide application in life, in particular when networks represent scenarios in form of either a bipartite or non-bipartite graph. Average distance μ of a graph G is one of the well-studied graph invariants. The graph invariants are often used in studying effici...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2021
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/78123 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: On Average Distance of Neighborhood Graphs and Its Applications
- General Adaptive Neighborhood Image Processing for Biomedical Applications
- Neighborhood Noise
- Distance Measure between Intuitionistic Fuzzy Sets with Its Application to TOPSIS and Decision-Making Problems
- Methods of Weighted Averaging with Application to Biomedical Signals
- Prospection of Neighborhood Megawatthours Scale Closed Loop Pumped Hydro Storage Potential
- An Explorative Perspective on the Resilience in Neighborhoods in the Netherlands