On identifying codes in the Cartesian product of a path and a complete graph

Jason Hedetniemi ()
Additional contact information
Jason Hedetniemi: Clemson University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 4, 1405-1416

Abstract: Abstract Identifying codes in the Cartesian product of a complete graph and a path are considered. After proving a set of sufficient conditions for a set in such a graph to be an identifying code, we then construct minimum identifying codes when the complete graph is of order three or at least five, and when the path is of order at least three.

Keywords: Identifying code; Graph products; Complete graph; Path; 05C69; 05C76 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9830-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:4:d:10.1007_s10878-015-9830-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9830-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().