Chromatic edge stability of graphs

عنوان به زبان ديگر

پديدآورندگان

Akbari S s_akbari@sharif.edu Sharif University of Technology, , Movarraei N nazanin.movarraei@gmail.com 2IRC, Kalasalingam University, Tamil Nadu, India , Nahvi M nahvi.mina@gmail.com Sharif University of Technology,

تعداد صفحه

2

كليدواژه

chromatic edge stability , coloring

سال انتشار

1396

عنوان كنفرانس

دهمين كنفرانس ملي نظريه گراف و تركيبات جبري

زبان مدرك

انگليسي

چكيده فارسي

Let G be a graph. The chromatic edge stability number of a graph G shown by esχ(G) is the minimum number of edges whose removal results in a graph H with χ(H) = χ(G) − 1. In this paper we have found some bounds for esχ(G). We have also characterized some classes of graphs with speciﬁc sizes of esχ(G).

چكيده لاتين

Let G be a graph. The chromatic edge stability number of a graph G shown by esχ(G) is the minimum number of edges whose removal results in a graph H with χ(H) = χ(G) − 1. In this paper we have found some bounds for esχ(G). We have also characterized some classes of graphs with speciﬁc sizes of esχ(G).

كشور

ايران