A note on Mycielskian type of a graph
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper we introduce and study an interesting graph transformation which we call the Mycielskian type graph of a graph. We show that MT(G), the Mycielskian type graph of a graph G has no k-fall coloring for any k >= 2. We also compute the spectrum of Mycielskian type graph of a k-regular graph G. Friendly index sets of Mycielskian type graphs of Pn and Cn are determined.
Abstract
In this paper we introduce and study an interesting graph transformation which we call the Mycielskian type graph of a graph. We show that MT(G), the Mycielskian type graph of a graph G has no k-fall coloring for any k >= 2. We also compute the spectrum of Mycielskian type graph of a k-regular graph G. Friendly index sets of Mycielskian type graphs of Pn and Cn are determined.
참고문헌 (10)
- R. A. Buraldi, "Energy of a graph, Note for AIM workshop on spectra of families of matrices described by graphs, diagraphs and sign patterns", ~ (2006)
- Daphne Der-FenLiu, "Circular chromatic number for iterated Mycielskian graphs", Disc. Math, 285, pp.335~340 (2004)
- J. E. Dunbar, "Fall coloring of graphs", J. Combin. Math. and Combin. Comput, 33, pp.257~273 (2000)
- D. Hajibolhassan, "The circular chromatic number and Mycielski construction", J. Graph Theory, 44, pp.106~115 (2003)
- Harris Kwong, "On friendly index sets of 2-regular graphs", Discrete Mathematics, 308, pp.5522~5532 (2008)
- Hongmei Liu, "Circular chromatic number and Mycielski graphs", Acta Mathematica Scientia, 26(2), pp.314~320 (2006)
- I. Gutman, "The energy of a graph", Ber. Math. Stat. Sekt. Forschungsz. Graz, 103, pp.1~22 (1978)
- I. Gutman, "The energy of a graph: old and new results, Combinatorics and applications", pp.196~211 (2001), Springer
- I. Gutman, "Polanski, Mathematical concepts in Organic Chemistry" (1986), Springer-Verlag
- J. Mycielski, "Sur le coloriage des graphes", Colloq. Math, 3, pp.161~162 (1955)