Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
暂无分享,去创建一个
[1] Roderick Gould. Graphs and Vector Spaces , 1958 .
[2] E. Margarita,et al. On vector spaces associated with a graph , 1977 .
[3] László Babai,et al. On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..
[4] Peter J. Slater. Domination and location in acyclic graphs , 1987, Networks.
[5] I. Beck. Coloring of commutative rings , 1988 .
[6] Mark G. Karpovsky,et al. On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.
[7] David F. Anderson,et al. The Zero-Divisor Graph of a Commutative Ring☆ , 1999 .
[8] Peter J. Slater,et al. Fault-tolerant locating-dominating sets , 2002, Discret. Math..
[9] Antoine Lobstein,et al. Identifying and locating-dominating codes: NP-Completeness results for directed graphs , 2002, IEEE Trans. Inf. Theory.
[10] Francesco De Pellegrini,et al. Robust location detection in emergency sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[11] C. Bates,et al. Commuting involution graphs for symmetric groups , 2003 .
[12] Antoine Lobstein,et al. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard , 2003, Theor. Comput. Sci..
[13] Iiro S. Honkala,et al. On Locating-Dominating Codes in Binary Hamming Spaces , 2004, Discret. Math. Theor. Comput. Sci..
[14] David Starobinski,et al. Robust location detection with sensor networks , 2004, IEEE Journal on Selected Areas in Communications.
[15] Nathalie Bertrand,et al. Identifying and locating-dominating codes on chains and cycles , 2004, Eur. J. Comb..
[16] David Starobinski,et al. An Implementation of Indoor Location Detection Systems Based on Identifying Codes , 2004, INTELLCOMM.
[17] Ari Trachtenberg,et al. Disjoint identifying-codes for arbitrary graphs , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[18] William E. Hart,et al. Discrete sensor placement problems in distribution networks , 2005, Math. Comput. Model..
[19] Mark G. Karpovsky,et al. On robust and dynamic identifying codes , 2006, IEEE Transactions on Information Theory.
[20] T. Berger-Wolf,et al. Identifying Codes and the Set Cover Problem , 2006 .
[21] D. Bundy,et al. The connectivity of commuting graphs , 2006, J. Comb. Theory, Ser. A.
[22] David R. Wood,et al. Extremal Graph Theory for Metric Dimension and Diameter , 2007, Electron. J. Comb..
[23] Reuven Cohen,et al. Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).
[24] Marcelo H. de Carvalho,et al. Vector Spaces and the Petersen Graph , 2008, Electron. J. Comb..
[25] A. Iranmanesh,et al. ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS , 2008 .
[26] Y. Talebi,et al. A kind of intersection graph of vector space , 2009 .
[27] Shamik Ghosh,et al. Undirected power graphs of semigroups , 2009 .
[28] Peter J. Cameron,et al. The power graph of a finite group , 2011, Discret. Math..
[29] W. Shi,et al. Certain properties of the power graph associated with a finite group , 2013, 1310.2032.
[30] H. Mic,et al. Vector space of a Graph , 2014 .
[31] Angsuman Das. Non-zero component union graph of a finite-dimensional vector space , 2017 .