期刊文献+

ON CLASSES OF REGULAR GRAPHS WITH CONSTANT METRIC DIMENSION

ON CLASSES OF REGULAR GRAPHS WITH CONSTANT METRIC DIMENSION
下载PDF
导出
摘要 In this paper, we are dealing with the study of the metric dimension of some classes of regular graphs by considering a class of bridgeless cubic graphs called the flower snarks Jn, a class of cubic convex polytopes considering the open problem raised in [M. Imran et al., families of plane graphs with constant metric dimension, Utilitas Math., in press] and finally Harary graphs H5,n by partially answering to an open problem proposed in Ⅱ. Javaid et al., Families of regular graphs with constant metric dimension, Utilitas Math., 2012, 88: 43-57]. We prove that these classes of regular graphs have constant metric dimension. In this paper, we are dealing with the study of the metric dimension of some classes of regular graphs by considering a class of bridgeless cubic graphs called the flower snarks Jn, a class of cubic convex polytopes considering the open problem raised in [M. Imran et al., families of plane graphs with constant metric dimension, Utilitas Math., in press] and finally Harary graphs H5,n by partially answering to an open problem proposed in Ⅱ. Javaid et al., Families of regular graphs with constant metric dimension, Utilitas Math., 2012, 88: 43-57]. We prove that these classes of regular graphs have constant metric dimension.
出处 《Acta Mathematica Scientia》 SCIE CSCD 2013年第1期187-206,共20页 数学物理学报(B辑英文版)
基金 supported by National University of Sceinces and Technology (NUST),Islamabad grant of Higher Education Commission of Pakistan Ref.No:PMIPFP/HRD/HEC/2011/3386 support of Slovak VEGA Grant 1/0130/12
关键词 metric dimension BASIS resolving set cubic graph flower snark convexpolytope metric dimension basis resolving set cubic graph flower snark convexpolytope
  • 相关文献

参考文献23

  • 1Buczkowski P S,Chartrand G,Poisson C,Zhang P. On k-dimensional graphs and their bases[J].Periodica Math Hung,2003,(01):9-15.
  • 2Caceres J,Garijo D,Puertas M L,Seara C. On the mdetermining number and the metric dimension of graphs[J].Electronic J Combin,2010.R63.
  • 3Caceres J,Hernando C,Mora M,Pelayo I M Puertas M L Seara C Wood D R. On the metric dimension of cartesian product of graphs[J].SIAM Journal on Discrete Mathematics,2007,(21):423-441.
  • 4Caceres J,Hernando C,Mora M,Pelayo I M Puertas M L Seara C Wood D R. On the metric dimension of some families of graphs[J].Electronic Notes in Disc Math,2005.129-133.
  • 5Cameron P J,Van Lint J H. Designs,Graphs,Codes and Their Links.London Mathematical Society Student Texts 22[M].Cambridge:Cambridge University Press,1991.
  • 6Chartrand G,Eroh L,Johnson M A,Oellermann O R. Resolvability in graphs and metric dimension of a graph[J].Discrete Applied Mathematics,2000.99-113.
  • 7Garey M R,Johnson D S. Computers and Intractability:A Guide to the Theory of NP-Completeness[M].New York:Freeman,1979.
  • 8Harary F. The maximum connectivity of a graph[J].Proceedings of the National Academy of Sciences(USA),1962.1142-1146.
  • 9Hernando C,Mora M,Pelayo I M,Seara C Wood D R. Extremal graph theory for metric dimension and diameter[J].Electronic J Combin,2010,(01):R30.
  • 10Imran M,Baig A Q,Ahmad A. Families of plane graphs with constant metric dimension[J].Utilitas Mathematica,2012.43-57.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部