Funder
Jenny ja Antti Wihurin Rahasto
Academy of Finland
Suomen Kulttuurirahasto
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference18 articles.
1. Auger D.: Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31(5), 1372–1384 (2010).
2. Charon I., Cohen G., Hudry O., Lobstein A.: New identifying codes in the binary Hamming space. Eur. J. Comb. 31(2), 491–501 (2010).
3. Foucaud F., Heydarshahi S., Parreau A.: Domination and location in twin-free digraphs. Discret. Appl. Math. (2020).
4. Haynes T.W., Hedetniemi S.T., Slater P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998).
5. Hernando C., Mora M., Pelayo I.M.: Locating domination in bipartite graphs and their complements. Discret. Appl. Math. 263, 195–203 (2019).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Scanning Desensitization of Sensitive Data Based on Low Code Modeling Language Technology;2022 International Conference on Knowledge Engineering and Communication Systems (ICKES);2022-12-28