Secure domination number of generalized thorn graphs

مراجع و منابع این مقاله:

• R. Arasu and N. Parvathi, Secure domination parameters of Halin ...
• M. Azari, On the Gutman index of thorn graphs, Kragujevac ...
• M. Azari and A. Iranmanesh, Dendrimer graphs as thorn graphs ...
• R. Balakrishnan and K. Ranganathan, A textbook of graph theory, ...
• D. Bonchev and D. Klein, On the wiener number of ...
• R. Burdett, M. Haythorpe, and A. Newcombe, Variants of the ...
• A. P. Burger, A. P. de Villiers, and J. H. ...
• A. P. Burger, M. A. Henning, and J. H. Van ...
• A. Cayley, On the mathematical theory of isomers, Phil. Magazine, ...
• E. J. Cockayne, Irredundance, Secure domination and maximum degree in ...
• E. J. Cockayne, P. J. P. Grobler, W. R. Gr ...
• Gisha Saraswathy and Manju K. Menon, Secure domination parameters in ...
• P. J. P. Grobler and C. M. Mynhardt, Secure domination ...
• I. Gutman, Distance of thorny graphs, Publications De L’institut Mathematique, ...
• M. Haythorpe and A. Newcombe, The secure domination number of ...
• S. A. Hosseini, M. B. Ahmadi, and I. Gutman, Kragujevac ...
• C. M. Mynhardt, H. C. Swart, and E. Ungerer, Excellent ...
• P. G. Nayana and I. R. Rajamani, On secure domination ...
• G. Polya, Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen, ...
• S. Shanmugavelan and C. Natarajan, On hop domination number of ...
• D. Yun-Ping, W. Haichao, and Z. Yancai, The complexity of ...
نمایش کامل مراجع