On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs

On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs

Assume that G=VG,EG is a connected graph. For a set of vertices WE⊆VG, two edges g1,g2∈EG are distinguished by a vertex x1∈WE, if dx1,g1≠dx1,g2. WE is termed edge metric generator for G if any vertex of WE distinguishes every two arbitrarily distinct edges of graph G. Furthermore, the edge metric di...

Full description

Saved in:
Bibliographic Details
Main Authors: Dalal Alrowaili, Zohaib Zahid, Imran Siddique, Sohail Zafar, Muhammad Ahsan, Muhammad Sarwar Sindhu
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2022/6738129
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items