Global color class domination partition of a graph
Künye
Venkatasubramanian, S. & Praba, V. (2019). Global color class domination partition of a graph. TWMS Journal of Applied and Engineering Mathematics, 9(3), 681-686.Özet
Color class domination partition was suggested by E. Sampathkumar and it was studied in [1]. A proper color partition of a finite, simple graph G is called a color class domination partition (or cd-partition) if every color class is dominated by a vertex. This concept is different from dominator color partition introduced in [[2], [3]] where every vertex dominates a color class. Suppose G has no full degree vertex (that is, a vertex which is adjacent with every other vertex of the graph). Then a color class may be independent from a vertex outside the class. This leads to Global Color Class Domination Partition. A proper color partition of G is called a Global Color Class Domination Partition if every color class is dominated by a vertex and each color class is independent of a vertex outside the class. The minimum cardinality of a Global Color Class Domination Partition is called the Global Color Class Domination Partition Number of G and is denoted by Xgcd(G). In this paper a study of this new parameter is initiated and its relationships with other parameters are investigated.
Cilt
9Sayı
3Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2759http://jaem.isikun.edu.tr/web/index.php/archive/102-vol9no3/452
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.
-
Total global dominator chromatic number of graphs
Askari, Saeid; Mojdeh, Doost Ali; Nazari, Esmaeil (Işık University Press, 2022)Let G = (V, E) be k-colorable (k-vertex colorable) graph and Vi ⊆ V be the class of vertices with color i. Then we assume that f = (V1, V2, · · · , Vk) is a coloring of G. A vertex v ∈ V (G) is a dominator of f if v dominates ... -
Color Laplacian energy of some cluster graphs
D’Soza, Sabitha; Gowtham, Halgar Jagadeesh; Bhat, Pradeep Ganapati; Girija, Kulambi Parameshwarappa (Işık University Press, 2022)The color energy of a graph G is defined as the sum of the absolute values of the color eigenvalues of G. The graphs with large number of edges are referred as cluster graphs. Cluster graphs are obtained from complete ... -
Some results on the distance r-b-coloring in graphs
Jothilakshmi, G.; Pushpalatha, A. P.; Suganthi, S.; Swaminathan, V. (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 ...