Cargando…
Computing the partition dimension of certain families of Toeplitz graph
Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path between them. A k-ordered partition of vertices...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Frontiers Media S.A.
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9614102/ https://www.ncbi.nlm.nih.gov/pubmed/36313814 http://dx.doi.org/10.3389/fncom.2022.959105 |