Equitable edge coloring on tensor product of graphs

Equitable edge coloring on tensor product of graphs

A graph G is edge colored if di¤erent colors are assigned to its edges or lines, in the order of neighboring edges are allotted with least diverse k-colors. If each of k-colors can be partitioned into color sets and di¤ers by utmost one, then it is equitable.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications Series A1 Mathematics & Statistics 2020-12, Vol.69 (2), p.1336-1344
Hauptverfasser: VENİNSTİNE, Vivik J, AKBAR ALI, M. M., GIRIJA, G.
Format: Artikel
Sprache:eng
Schlagworte:
Matematik
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A graph G is edge colored if di¤erent colors are assigned to its edges or lines, in the order of neighboring edges are allotted with least diverse k-colors. If each of k-colors can be partitioned into color sets and di¤ers by utmost one, then it is equitable.
ISSN:1303-5991
DOI:10.31801/cfsuasmas.716392