Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Ayyaswamy, S.K."'
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics July 2018
Publikováno v:
In Applied Mathematics and Computation 15 September 2017 309:156-169
Publikováno v:
In Applied Mathematics and Computation 15 February 2016 275:422-431
Autor:
Natarajan C., Ayyaswamy S.K.
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 23, Iss 2, Pp 187-199 (2015)
Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted
Externí odkaz:
https://doaj.org/article/7bc977bd4d8a4cae8f54aaef29bbb2f9
Publikováno v:
In Journal of Mathematical Analysis and Applications 1 March 2014 411(1):196-200
Publikováno v:
In Ain Shams Engineering Journal December 2013 4(4):925-932
Publikováno v:
In Ain Shams Engineering Journal December 2012 3(4):417-422
Publikováno v:
In Computers and Mathematics with Applications April 2012 63(8):1287-1295
Publikováno v:
In Discrete Applied Mathematics November 2013 161(16-17):2740-2744
Publikováno v:
AKCE International Journal of Graphs and Combinatorics; January 2020, Vol. 17 Issue: 1 p25-37, 13p