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

DOI10.61091/UM128-22MaRDI QIDQ7347809zbMATH OpenFDO

Authors Saeedeh Tahmasebi, Jafar A'zami, Farshad Kazemnejad

Publication date 15 September 2026

Published in Utilitas Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/UM128-22

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other types of codes (94B60)

Cites work

• Domination number of middle graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• Identifying code number of some of the middle graphs
• 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
• New results of identifying codes in product graphs
• On a new class of codes for identifying vertices in graphs
• On Identifying Codes in the Triangular and Square Grids
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Proof of a conjecture for the identifying codenumber of the subdivision of graphs
• The first order definability of graphs: Upper bounds for quantifier depth
• Total dominator coloring number of middle graphs
• Traversability and connectivity of the middle graph of a graph

This page was built for publication: On a class of graphs with equal identifying code number and independence number

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