Ara
Toplam kayıt 2, listelenen: 1-2
Trivially extendable graphs
(Işık University Press, 2015-03-24)
Let G be a simple graph. Let k be a positive integer. G is said to be k-extendable if every independent set of cardinality k is contained in a maximum independent set of G. G is said to be trivially extendable if G is not ...
Some results on the distance r-b-coloring in graphs
(Işık University Press, 2016)
Given a positive integer r, two vertices u, v ∈ V (G) are r- independent if d(u, v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring ...