Some Resolving Parameters in a Class of Cayley Graphs

Jia-Bao Liu, Ali Zafari and Ali Ahmad

Journal of Mathematics, 2022, vol. 2022, 1-5

Abstract: Resolving parameters are a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this study, we construct a class of Toeplitz graphs and will be denoted by T2nW so that they are Cayley graphs. First, we review some of the features of this class of graphs. In fact, this class of graphs is vertex transitive, and by calculating the spectrum of the adjacency matrix related with them, we show that this class of graphs cannot be edge transitive. Moreover, we show that this class of graphs cannot be distance regular, and because of the difficulty of the computing resolving parameters of a class of graphs which are not distance regular, we regard this as justification for our focus on some resolving parameters. In particular, we determine the minimal resolving set, doubly resolving set, and strong metric dimension for this class of graphs.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/9444579.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/9444579.xml (application/xml)

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:hin:jjmath:9444579

DOI: 10.1155/2022/9444579

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().