Chromatic index of split graphs with
Abstract: 161
| 
PDF: 32 
##plugins.themes.academic_pro.article.main##
Author
Keywords:
split graph
edge coloring
chromatic index
class one graph
class two graph
Abstract
A graph is called a split graph if there exists a partition in such a way that the subgraphs of induced by and are empty and complete, respectively. We will denote such a graph by. The notion of split graphs was introduced in 1977 by S. Foldes and P.L.Hammer. These graphs have also been paid attention to because they have connection with packing and knapsack problems, with the matroid theory, with Boolean function,…. In this paper, some sufficient conditions for split graphs to be Class one are proved. In particular, we determine chromatic index of split graphs with
.
We show that chromatic index of is.
.
We show that chromatic index of is.
References
-
[1] M. Behazad and G. Chartrand (1971), Introduction to the Theory of graphs, Allyn and Bacon, Boston.
[2] M. Behazad and G. Chartrand and J. Cooper (1967), The coloring numbers of complete graphs, J. London Math. Soc. 42, 226 – 228.
[3] G. D. Birkhoff (1912), A determinant formula for the number of ways of coloring a map, Annals of Math, 14 (2), 42 -46.
[4] J. A. Bondy and U. S. R. Murty (1976), Graph theory with applications, MacMillan.
[5] B.-L. Chen, H.-L Fu, M.T. Ko (1995), Total chromatic number and chromatic index of split graphs, J. Combin. Math. Combin. Comput. 17, 137 – 146.
[6] V. Chvatal and P.L. Hammer (1977), Aggregation of inequalities in integer programming, Ann. Discrete Math. 1, pp. 145 – 162.
[7] S. Foldes and P.L. Hammer (1977), Split graphs, In: Proceeding of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State University, Baton Rouge, LA, 1977), Congressus Numerantium, vol. XIX, Utilitas Mathematics, Winnipeg, Man., pp. 311 – 315.
[8] S. Foldes and P.L. Hammer (1978), On a class of matroid-producing graphs, In: Combinatorics (Proceeding of the Filth Hungarian Colloquium, Kesrthely, 1976), vol. 1, Colloquium Mathematical Society, Jano’s Bolyai, vol. 18, North-Holland, Amsterdam, New York, pp. 331 - 352.
[9] P. B. Henderson and Y. Zalcstein (1977), A graph-theoretic characterization of the class of synchroniring primitive, SIAM J. Comput. 6, 88-108.
[10] A. Hesham H. And El-R. Hesham (1993), Task allocation in distributed systems: a split graph model, J. Combin. Math. Combin. Comput. 14, 15-32.
[11] A. J. W. Hilton and C. Zhao (1992), The chromatic index of a graph whose core has maximum degree two, Discrete Math. 101, 135 – 147.
[12] A. J. W. Hilton and C. Zhao (1996), On the edge-colouring of graphs whose core has maximum degree two, J. Combin. Math. Combin. Comput. 21, 97 – 108.
[13] Lê Xuân Hùng (2014), Sắc số, đa thức tô màu và tính duy nhất tô màu của đồ thị tách cực, Tạp chí Khoa học và Giáo dục, Trường Đại học Sư phạm, ĐHĐN. 13(04), 23 – 27.
[14] U. N. Peled (1975), Regular Boolean functions and their polytope, Chapter VI, PH. D. Thesis, Univ. Of Waterloo, Dept. Combin. And Optimization.
Read more
##plugins.themes.academic_pro.article.sidebar##
Published
Sep 30, 2015
Download
How to Cite
Le Xuan Hung. “Chromatic Index of Split Graphs With”. The University of Danang - Journal of Science and Technology, vol. 9, no. 94, Sept. 2015, pp. 95-98, https://jst-ud.vn/jst-ud/article/view/2540.
