A Note On The Partition Dimension of Thorn of Fan Graph
Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of concerning is the k-vector, where denotes the distance between and for. The k-partition is said to be resolving if for every two vertices, the representation. The minimum k for which there is a resolving k-...
Guardado en:
Autor principal: | Auli Mardhaningsih |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Department of Mathematics, UIN Sunan Ampel Surabaya
2019
|
Materias: | |
Acceso en línea: | https://doaj.org/article/486b66570c3940ae939e199c1f902486 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Clustering Vertex-Weighted Graphs by Spectral Methods
por: Juan-Luis García-Zapata, et al.
Publicado: (2021) -
Flexibility in partitioning strategies of fourth graders
por: Yeliz Yazgan
Publicado: (2021) -
On Andrews’ Partitions with Parts Separated by Parity
por: Abdulaziz M. Alanazi, et al.
Publicado: (2021) -
Some characterization theorems on dominating chromatic partition-covering number of graphs
por: Michael Raj,L. Benedict, et al.
Publicado: (2014) -
AGAT: Building and evaluating binary partition trees for image segmentation
por: Jimmy Francky Randrianasoa, et al.
Publicado: (2021)