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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Mwakilama, Elias, Ali, Patrick, Chidzalo, Patrick, Mtonga, Kambombo, Eneya, Levis
Formato: Capítulo de libro
Lenguaje:inglés
Publicado: IntechOpen 2021
Materias:
Acceso en línea:https://www.intechopen.com/chapters/78123
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!