On Partition Dimension of Generalized Convex Polytopes
On Partition Dimension of Generalized Convex Polytopes
About this item
Full title
Author / Creator
Publisher
Cairo: Hindawi
Journal title
Language
English
Formats
Publication information
Publisher
Cairo: Hindawi
Subjects
More information
Scope and Contents
Contents
Let G be a graph having no loop or multiple edges, k−order vertex partition for G is represented by γ=γ1,γ2,…,γk. The vector rϕγ=dϕ,γ1,dϕ,γ2,dϕ,γ3⋯,dϕ,γk is the representation of vertex ϕ with respect to γ. If the representation of all the vertices with respect to γ is different, then γ is said to be resolving partition for the graph G. The minimum...
Alternative Titles
Full title
On Partition Dimension of Generalized Convex Polytopes
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_c53e528042164baaa7afa155bd5855de
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_c53e528042164baaa7afa155bd5855de
Other Identifiers
ISSN
2314-4629
E-ISSN
2314-4785
DOI
10.1155/2023/4412591
