. .(3) If G has n 2 components G1. , : .
Akbari S.,Alikhani S. .2010 .Yee-hock Peng: Characterization of graphs using domination polynomials. European J. Combin, 31 : 1714-1724.
Albertson M. O.,Boutin D. L. .2007 .Using determining sets to distinguish Kneser graphs. Electron. J. Combin, 14 : .
Albertson M. O. .1996 .Symmetry breaking in graphs, Electron. , 3 : .
Biggs N. .1993 .. , : .
Boutin D. L. .2006 .Identifying graph automorphisms using determining sets, Electron. , 13 : .
Caceres J.,Garijo D.,Puertas M. L.,C. M. L. .2010 .Seara: On the determining number and the metric dimension of graphs, Electron. , 17 : .
F. M. ,Illustrated Edition .2005 .Dong: Chromatic polynomials and chromaticity of graphs. , : .
Erwin D.,F. D. .2006 .Harary: Destroying automorphisms by xing nodes. , 306 : 3244-3252.
Farrell E. J. .1979 .On a general class of graph polynomials. J. Combin. Theory B, 26 : 111-122.
Gibbons C. R.,Laison J. D. .2009 .Fixing numbers of graphs and groups. Electron. J. Combin, 16 : .
Gutman I.,F. I. .1983 .Harary: Generalizations of the matching polynomial. , 24 : 97-106.
Harary F. .2001 .: Methods of destroying the symmetries of graph. Bull. Malasyan Math., Sc. Soc, 24 : 183-191.
Lynch K. .2001 .: Determining the orientation of a painted sphere from a single image : a graph coloring problem. , : .
Salman M.,Chaudhry M. A.,I. M. A. . .Javaid: The resolving polynomial of graph, Revised version submitted to Int. , : .