Have a personal or library account? Click to login
Independent [1,2]-number versus independent domination number Cover

References

  1. [1] D.W. Bange, A.E. Barkauskas, P.J. Slater, E_cient dominating sets in graphs, Applications of Discrete Mathematics. Proceedings of the Third SIAM Conference on Discrete Mathematics (1986) 189-199.
  2. [2] G. Chartrand, L. Lesniak, P. Zhang, Graphs and Digraphs, (5th edition), CRC Press,,2011.10.1201/b14892
  3. [3] M. Chellali, S.T. Hedetniemi and A. McRae, [1; 2]-set in graphs, Discrete Appl. Math. 161 (2013), 2885-2893.10.1016/j.dam.2013.06.012
  4. [4] M. Chellali, O. Favaron, T.W. Haynes, S.T. Hedetniemi and A. McRae, Independent [1; k]-sets in grahps, Australas. J. Combin. 59(1) (2014), 144-156.
  5. [5] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domi- nation in Graphs, Marcel Dekker Inc., 1998.
  6. [6] M. Livingston, Q.F. Stout, Perfect Dominating Sets, Congr. Numer., 79 (1990), 187-203.
  7. [7] E.B. Santoso, R.M. Marcelo, Existence on independent [1; 2]-sets in cater- pillars, Proceedings of the 7th SEAMUS UGM International Conference on Mathematics and its Applications 2015. AIP Conference Proceedings, 1707 (2016), ]020019.10.1063/1.4940820
DOI: https://doi.org/10.1515/auom-2017-0031 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 5 - 24
Submitted on: Nov 22, 2016
|
Accepted on: Nov 29, 2016
|
Published on: Mar 31, 2018
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2018 Sahar A. Aleid, Mercè Mora, María Luz Puertas, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.