2015
DOI: 10.1016/j.procs.2015.12.075
|View full text |Cite
|
Sign up to set email alerts
|

The Partition Dimension of a Subdivision of a Complete Graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(7 citation statements)
references
References 3 publications
0
7
0
Order By: Relevance
“…The new vertices in the graph S(G(e; k)) are called subdivision vertices of S(G(e; k)). Some known results regarding the partition dimension of graphs obtained from a subdivision operation can be found in [3,5,4,2].…”
Section: Introductionmentioning
confidence: 99%
“…The new vertices in the graph S(G(e; k)) are called subdivision vertices of S(G(e; k)). Some known results regarding the partition dimension of graphs obtained from a subdivision operation can be found in [3,5,4,2].…”
Section: Introductionmentioning
confidence: 99%
“…Many papers studied about the partition dimension that containing cycles, see [18,14,1]. While, various results of the locating-chromatic number that containing cycles, see [16,17,4,11].…”
Section: Introductionmentioning
confidence: 99%
“…In addition to the metric dimension, some researchers use another variant to solve the problem of the dimension of the graph, namely partition dimensions. The partition dimension appears in many published articles, namely the partition dimension of subdivision homogeneous caterpillar [6], homogeneous firecrackers [7], subdivision of a Complete graph [8] and a complete multipartite graph [9].…”
Section: Introductionmentioning
confidence: 99%