| Authors | سعید اکبری,سیده الهام قاسمیان,غلامحسین فتح تبار فیروزجائی |
|---|---|
| Conference Title | 17-th workshop on graph theory |
| Holding Date of Conference | 2017-9-17 |
| Event Place | زیلونا |
| Presentation | SPEECH |
| Conference Level | International Conferences |
Abstract
In this paper, we extend some results of Wilf's theorem for simple graphs to sighned graphs. we prove that chromatic number of graph G is less than sum of chromatic number of G^_, maximum eigenvalue and 2.