Some results on the distance r-b-coloring in graphs
Künye
Jothilakshmi, G., Pushpalatha, A.P., Suganthi, S. & Swaminathan, V. (2016). Some results on the distance r-b-coloring in graphs. TWMS Journal of Applied and Engineering Mathematics, 6(2), 315-323.Özet
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 concepts are studied in this paper.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
6Sayı
2Bağlantı
https://hdl.handle.net/11729/2602http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/261
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Status connectivity indices of cartesian product of graphs
Kandan, Pattabiraman (Işık University Press, 2019)In this paper, we establish one of the recent topological indices called the first status connectivity index S1(G) = Puv∈E(G)[σG(u) + σG(v)] and second status connectivity index S2(G) = Puv∈E(G)[σG(u)σG(v)] of Cartesian ... -
Some inequalities for the graph energy of distance Laplacian matrix
Kaya Gök, Gülistan (Işık University Press, 2022)In this paper, the distance laplacian energy for distance matrix is examined. Some bounds for the laplacian eigenvalues of distance matrix are expanded including the distances, the vertices and the edges. Indeed, different ... -
Stronger reconstruction of distance-hereditary graphs
Priya, P. Devi; Monikandan, S. (Işık University Press, 2021)A graph is said to be set-reconstructible if it is uniquely determined up to isomorphism from the set S of its non-isomorphic one-vertex deleted unlabeled subgraphs. Harary’s conjecture asserts that every finite simple ...