×

Minimal doubly resolving sets of prism graphs. (English) Zbl 1278.05087

Summary: In this paper, we consider the problem of determining the minimal cardinality of double resolving sets for prism graphs \(Y_n\). It is proved that the minimal cardinality is equal to four if \(n\) is even and equal to three if \(n\) is odd.

MSC:

05C12 Distance in graphs
68R10 Graph theory (including graph drawing) in computer science
05C75 Structural characterization of families of graphs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Slater PJ, Leaves of trees. Congr. Numerantium. 14 pp 549– (1975)
[2] Harary F, Ars Combinatoria. 2 pp 191– (1976)
[3] DOI: 10.1109/JSAC.2006.884015 · doi:10.1109/JSAC.2006.884015
[4] DOI: 10.1016/0166-218X(95)00106-2 · Zbl 0865.68090 · doi:10.1016/0166-218X(95)00106-2
[5] DOI: 10.1007/s10589-007-9154-5 · Zbl 1191.68469 · doi:10.1007/s10589-007-9154-5
[6] DOI: 10.1016/j.cor.2008.08.002 · Zbl 1158.90414 · doi:10.1016/j.cor.2008.08.002
[7] DOI: 10.1137/050641867 · Zbl 1139.05314 · doi:10.1137/050641867
[8] DOI: 10.1090/S0002-9904-1950-09407-5 · Zbl 0040.22803 · doi:10.1090/S0002-9904-1950-09407-5
[9] Javaid I, Utilitas Mathematica. 75 pp 21– (2008)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.