Konu "Total coloring" için JAEM 2020, Vol 10, No 3 listeleme
Toplam kayıt 2, listelenen: 1-2
-
Edge irregular reflexive labeling for star, double star and caterpillar graphs
(Işık University Press, 2020)A graph labeling is an algorithm that assignment the labels, traditionally represented by integers, to the edges or vertices, or both, of a network(graph) G. Formally, given a graph G = (V, E), a vertex labeling is a ... -
Total colorings of core-satellite, cocktail party and modular product graphs
(Işık University Press, 2020)A total coloring of a graph G is a combination of vertex and edge colorings of G. In other words, is an assignment of colors to the elements of the graph G such that no two adjacent elements (vertices and edges) receive a ...