Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 87, 2010 - Issue 12: Section B Special Section: Third International Conference on Mathematical Sciences, Al-Ain, UAE, March 2008
Submit an article Journal homepage
52
Views
9
CrossRef citations to date
0
Altmetric
Section A

The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori

Fu-Hsing Wang Department of Information Management, Chinese Culture University, 55 Hwa Kang Road, Yang-Ming-Shan, Taipei, Taiwan, Republic of ChinaCorrespondence[email protected]
Pages 2677-2687 | Received 11 Feb 2008, Accepted 21 Apr 2009, Published online: 16 Aug 2010

References

  • Buckley , F. and Harary , F. 1986 . Geodetic games for graphs . Quaest. Math. , 8 : 321 – 334 .
  • Buckley , F. , Harary , F. and Quintas , L. V. 1988 . Extremal results on the geodetic number of a graph . Scientia , 2A : 17 – 26 .
  • Chartrand , G. , Gavlas , H. , Vandell , R. C. and Harary , F. 1997 . The forcing domination number of a graph . J. Combin. Math. Combin. Comput. , 25 : 161 – 174 .
  • Chartrand , G. , Harary , F. and Zhang , P. 1998 . Extremal problems in geodetic graph theory . Congr. Numer. , 130 : 157 – 168 .
  • Chartrand , G. , Harary , F. and Zhang , P. 2002 . On the geodetic number of a graph . Networks , 39 : 1 – 6 .
  • Chartrand , G. and Zhang , P. 1999 . Realizable ratios in graph theory: geodesic parameters . Bull. Inst. Combin. Appl. , 27 : 69 – 80 .
  • Chartrand , G. and Zhang , P. 1999 . The forcing geodetic number of a graph . Discuss. Math. Graph Theory , 19 : 45 – 58 .
  • Chartrand , G. and Zhang , P. 2000 . The geodetic number of an oriented graph . European J. Combin. , 21 : 181 – 189 .
  • Chartrand , G. and Zhang , P. 2001 . The forcing convexity number of a graph . Czechoslovak Math. J. , 51 : 847 – 858 .
  • Chartrand , G. and Zhang , P. 2002 . The Steiner number of a graph . Discrete Math. , 242 : 41 – 54 .
  • Harary , F. , Loukakis , E. and Tsouros , C. 1993 . The geodetic number of a graph . Math. Comput. Modelling , 17 : 89 – 95 .
  • Haynes , T. W. , Henning , M. A. and Tiller , C. 2003 . Geodetic achievement and avoidance games for graphs . Quaest. Math. , 26 : 389 – 397 .
  • Kortsarz , G. and Peleg , D. 1999 . Approximating the weight of shallow steiner trees . Discrete Appl. Math. , 93 : 265 – 285 .
  • Necásková , M. 1988 . A note on the achievement geodetic games . Quaest. Math. , 12 : 115 – 119 .
  • Riddle , M. E. 2002 . The minimum forcing number for the torus and hypercube . Discrete Math. , 245 : 283 – 292 .
  • Wang , F. H. , Wang , Y. L. and Chang , J. M. 2006 . The lower and upper forcing geodetic numbers of block-cactus graphs . European J. Oper. Res. , 175 : 238 – 245 .
  • Zhang , P. 2002 . The upper forcing geodetic number of a graph . Ars Combin. , 62 : 3 – 15 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.