Log in to save to my catalogue

The metric dimension of strong product graphs

The metric dimension of strong product graphs

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_37193_CJM_2015_02_15

Publication information

Publisher

SINUS Association

More information

Scope and Contents

Contents

For an ordered subset S = {s₁, s₂, ...sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s₁), dG(v, s₂), ..., dG(v, sk)), where dG(x, y) represents the distance between the vertices x and y. The set S is a metric generator for G if every two different vertices of...

Alternative Titles

Full title

The metric dimension of strong product graphs

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_crossref_primary_10_37193_CJM_2015_02_15

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_37193_CJM_2015_02_15

Other Identifiers

ISSN

1584-2851

E-ISSN

1843-4401

DOI

10.37193/CJM.2015.02.15

How to access this item