Abstract
For the vertex v of graph G and the subset N⊆V(G) of the vertex set, let IN(v)={N∩NG[v]}. If, for all vertices v’s of G, IN(v)’s are distinct non-empty sets, then N is said to be an identifying code and we indicate it by i(G). A graph G is called identifiable, if distinct vertices of this graph have distinct closed neighboods. In the current work, we investigate some upper bounds for the identifying code of given graph products.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
