Cargando…
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
All graphs of order n with partition dimension 2, [Formula: see text] , [Formula: see text] , or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open. In this paper, we characterize all graphs of order [Formula: se...
Autores principales: | Baskoro, Edy Tri, Haryeni, Debi Oktia |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7160584/ https://www.ncbi.nlm.nih.gov/pubmed/32322708 http://dx.doi.org/10.1016/j.heliyon.2020.e03694 |
Ejemplares similares
-
Subdivision of graphs in [Formula: see text]
por: Wijaya, Kristiana, et al.
Publicado: (2020) -
Computing the partition dimension of certain families of Toeplitz graph
por: Luo, Ricai, et al.
Publicado: (2022) -
PPanGGOLiN: Depicting microbial diversity via a partitioned pangenome graph
por: Gautreau, Guillaume, et al.
Publicado: (2020) -
Graph Partitions in Chemistry
por: Michos, Ioannis, et al.
Publicado: (2023) -
The Formula of Grangeat for Tensor Fields of Arbitrary Order in n Dimensions
por: Schuster, T.
Publicado: (2007)