JOURNAL ARTICLE

Monitoring Edge-Geodetic Numbers of Generalized Hierarchical Product Graphs.

  • Published In: Journal of Interconnection Networks, 2026, v. 26, n. 4. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Qin, Peiyao; Ji, Zhen; Zhang, Ayun; Liang, Jinxia 3 of 3

Abstract

Let G be a graph with vertex set V (G) and edge set E (G). For two vertices u , v ∈ V (G) and an edge e ∈ E (G) , we say u , v monitor e if e belongs to all shortest paths from x to y. For a vertex set M ⊆ V (G) , if every edge of G can be monitored by a pair of vertices in M , then M is a monitoring edge-geodetic set (MEG-set for short) of G. The monitoring edge-geodetic number (MEG number for short), denoted by meg (G) , is the size of the smallest MEG-set of G. In this paper, we obtain exact values or sharp bounds on MEG numbers of generalized hierarchical product graphs. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Journal of Interconnection Networks. 2026/12, Vol. 26, Issue 4, p1
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2026
  • ISSN:0219-2659
  • DOI:10.1142/S021926592550015X
  • Accession Number:193655376
  • Copyright Statement:Copyright of Journal of Interconnection Networks is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.