Identifying code number of some of the middle graphs

DOI10.30504/JIMS.2026.538124.1271MaRDI QIDQ7312409zbMATH OpenFDO

Authors Hamidreza Nadimi Dafrazi, Ebrahim Vatandoost

Publication date 11 August 2026

Published in Journal of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.30504/JIMS.2026.538124.1271

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76) Other types of codes (94B60)

Cites work

• 2-rainbow domination number of the subdivision of graphs
• Domination number and identifying code number of the subdivision graphs
• Domination number and watching number of subdivision construction of graphs
• Domination number of middle graphs
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• Identifying codes and locating-dominating sets on paths and cycles
• Identifying codes of cycles
• Minimal identifying codes in trees and planar graphs with large girth
• On a new class of codes for identifying vertices in graphs
• On Identifying Codes in the Triangular and Square Grids
• The identifying code number and functigraphs
• Traversability and connectivity of the middle graph of a graph

Cited in

(1)

• On a class of graphs with equal identifying code number and independence number

This page was built for publication: Identifying code number of some of the middle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312409)