Total Resolvability in Graphs
暂无分享,去创建一个
[1] Imran Javaid,et al. Metric Dimension and Determining Number of Cayley Graphs , 2012 .
[2] Gary Chartrand,et al. The partition dimension of a graph , 2000 .
[3] Ping Zhang,et al. Conditional resolvability in graphs: a survey , 2004, Int. J. Math. Math. Sci..
[4] Peter J. Cameron,et al. Designs, graphs, codes, and their links , 1991 .
[5] Azriel Rosenfeld,et al. Localization in graphs , 1994 .
[6] Imran Javaid,et al. Resolvability in circulant graphs , 2012 .
[7] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.
[8] G. Chartrand,et al. The theory and applications of resolvability in graphs: A survey , 2003 .
[9] Ioan Tomescu,et al. Metric bases in digital geometry , 1984, Comput. Vis. Graph. Image Process..
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Gary Chartrand,et al. Resolvability in graphs and the metric dimension of a graph , 2000, Discret. Appl. Math..
[12] Azriel Rosenfeld,et al. Landmarks in Graphs , 1996, Discret. Appl. Math..
[13] András Sebö,et al. On Metric Generators of Graphs , 2004, Math. Oper. Res..