Locating and identifying codes in dihedral graphs

Shu Jiao Song, Xingtian Ning and Panpan Cheng

Applied Mathematics and Computation, 2022, vol. 416, issue C

Abstract: The smallest cardinalities of identifying and locating codes in dihedral graphs are studied in this paper which is the first step to study these codes in general networks.

Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321008341
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:416:y:2022:i:c:s0096300321008341

DOI: 10.1016/j.amc.2021.126752

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().