The identifying code number and functigraphs

DOI10.22044/JAS.2021.9902.1487MaRDI QIDQ5046030zbMATH OpenFDO

Authors Athena Shaminejad, Ebrahim Vatandoost

Publication date 8 November 2022

Full work available at URL https://doi.org/10.22044/JAS.2021.9902.1487

zbMATH Keywords

functigraphidentifiable graphidentifying code

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• The identifying code number and Mycielski's construction of graphs
• On the number of optimal identifying codes in a twin-free graph
• The minimum identifying code graphs
• Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
• Minimum identifying codes in some graphs differing by matchings

Cited in

(5)

• From eventually different functions to pandemic numberings
• The security number of lexicographic products
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• Domination number and identifying code number of the subdivision graphs
• Identifying code number of some of the middle graphs

Describes a project that uses

Uses Software

• Hilbert class library

This page was built for publication: The identifying code number and functigraphs

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