Chen Xiang-en
Abstract
This thesis was to make VDIET chromatic numbers for complete bipartite graph K7,n(n≥8).Different sections of n were got through the calculation χievt(G)≥ζ(G).Certain Dyeing scheme and inference were also used to get vertex-distinguishing IE-total-coloring of K7,n(n≥8).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This thesis was to make VDIET chromatic numbers for complete bipartite graph K7,n(n≥8).Different sections of n were got through the calculation χievt(G)≥ζ(G).Certain Dyeing scheme and inference were also used to get vertex-distinguishing IE-total-coloring of K7,n(n≥8).
Key concepts: Bipartite graph, Combinatorics, Complete bipartite graph, Chromatic scale, Mathematics, Windmill graph, Vertex (graph theory), Graph