شماره ركورد كنفرانس :
3806
عنوان مقاله :
Some Bound for the Eigenvalue of Signed Graphs and the Chromatic Number
پديدآورندگان :
Akbari S s akbari@sharif.edu Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran. , Ghasemian E e.ghasemian@grad.kashanu.ac.ir Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran. , Fath-Tabar G. H fathtabar@kashanu.ac.ir Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran.
تعداد صفحه :
3
كليدواژه :
singed graph , signed eigenvalues , chromatic number
سال انتشار :
1396
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
زبان مدرك :
انگليسي
چكيده فارسي :
Let G = (V,E) be a simple graph of order n. If σ : E(G) −→ {±} is a mapping, then the graph G together with the sign function σ is called a signed graph and denoted by Gσ. In [3] Wilf proved that χ(G) ≤ 1 + λ1(G), where χ(G) is the vertex chromutic number of G and λ1(G) is the maximum eigenvalue of G. In this paper, we would like to extend this result to signed graphs. Some properties of eigenvalues of signed graph have been studied in [1].
كشور :
ايران
لينک به اين مدرک :
بازگشت