Cargando…
The partition dimension of the vertex amalgamation of some cycles
Let [Formula: see text] be a connected, finite, simple, and undirected graph. The distance between two vertices [Formula: see text] , denoted by [Formula: see text] , is the shortest length of [Formula: see text]-path in G. The distance between a vertex [Formula: see text] is defined as [Formula: se...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9193875/ https://www.ncbi.nlm.nih.gov/pubmed/35711982 http://dx.doi.org/10.1016/j.heliyon.2022.e09596 |