Further new results on strong resolving partitions for graphs
Further new results on strong resolving partitions for graphs
About this item
Full title
Further new results on strong resolving partitions for graphs
Author / Creator
Publisher
Warsaw: De Gruyter
Journal title
Open mathematics (Warsaw, Poland), 2020-05, Vol.18 (1), p.237-248
Language
English
Formats
Publication information
Publisher
Warsaw: De Gruyter
Subjects
More information
Scope and Contents
Contents
A set
of vertices of a connected graph
strongly resolves two different vertices
,
∉
if either
,
) =
,
) +
,
) or
,
) =
,
) +
,
), where
,
) = min{
):
∈
} and
) represents the length of a shortest
−
path. An ordered vertex partition
= {
,
,…,
} of a grap...
Alternative Titles
Full title
Further new results on strong resolving partitions for graphs
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_84355dcbba4849a2b0344cb1fc398aa7
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_84355dcbba4849a2b0344cb1fc398aa7
Other Identifiers
ISSN
2391-5455
E-ISSN
2391-5455
DOI
10.1515/math-2020-0142
How to access this item
Log in as a Library member
