首页|Locating and identifying codes in dihedral graphs

Locating and identifying codes in dihedral graphs

扫码查看
原文链接
  • NSTL
  • Elsevier
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. (C) 2021 Elsevier Inc. All rights reserved.

VERTICES

Song, Shu Jiao、Ning, Xingtian、Cheng, Panpan

展开 >

Yantai Univ

2022

10.1016/j.amc.2021.126752

Applied mathematics and computation

Applied mathematics and computation

EISCI
ISSN：0096-3003
年,卷(期)：2022.416
  • 1
  • 9