78
Views
0
CrossRef citations to date
0
Altmetric
Section A

Signed 2-independence of Cartesian product of directed paths

&
Pages 1190-1201 | Received 10 Oct 2012, Accepted 06 Aug 2013, Published online: 12 Nov 2013

References

  • G. Chartrand and L. Lesniak, Graphs and Digraphs, 4th ed., Chapman and Hall, Boca Raton, FL, 2005.
  • M.A. Henning, Signed 2-independence in graphs, Discrete Math. 250 (2002), pp. 93–107. doi: 10.1016/S0012-365X(01)00275-8
  • J. Liu, X.D. Zhang, X. Chen, and J. Meng, The domination number of Cartesian products of directed cycles, Inform. Process. Lett. 110 (2010), pp. 171–173. doi: 10.1016/j.ipl.2009.11.005
  • J. Liu, X.D. Zhang, and J. Meng, On domination number of Cartesian product of directed paths, J. Combin. Optim. 22 (2011), pp. 651–662. doi: 10.1007/s10878-010-9314-x
  • M. Mollard, The domination number of Cartesian product of two directed paths, J. Combin. Optim. (2012). Online published, doi:10.1007/s10878-012-9494-7.
  • M. Mollard, On domination of Cartesian product of directed cycles, Discuss. Math. Graph Theory 33(2) (2013), pp. 387–394. doi: 10.7151/dmgt.1668
  • R.S. Shaheen, Domination number of toroidal grid digraphs, Util. Math. 78 (2009), pp. 175–184.
  • E.F. Shan, M.Y. Sohn, and L.Y. Kang, Upper bounds on signed 2-independence number of graphs, Ars Combin. 69 (2003), pp. 229–239.
  • L. Volkmann, Signed 2-independence in digraphs, Discrete Math. 312 (2012), pp. 465–471. doi: 10.1016/j.disc.2011.09.009
  • B. Zelinka, On signed 2-independence numbers of graphs, Manuscript.
  • X.D. Zhang, J. Liu, X. Chen, and J. Meng, Domination number of Cartesian products of directed cycles, Inform. Process. Lett. 111 (2010), pp. 36–39. doi: 10.1016/j.ipl.2010.10.001
  • W. Zhao, Lower against number in graphs, Int. J. Pure Appl. Math. 77(2) (2012), pp. 149–155.

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:

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:

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.