An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence
Authors: 
Prantik Biswas, Chumki Acharya, Nirupam Chakrabarti, Shreyasi Das, Abhisek Paul, Paritosh BhattacharyaAuthors Info & Claims
Prantik Biswas, Chumki Acharya, Nirupam Chakrabarti, Shreyasi Das, Abhisek Paul, Paritosh BhattacharyaAuthors Info & ClaimsPages 458 - 462
Abstract
Spectral graph theory is a popular topic in modern day applied mathematics. Spectral graph theoretic techniques are widely used to extract a large variety of information about different properties of a graph from its adjacency matrix. A well known physical property of a graph is its chromatic number. In this paper, we have proposed an efficient approach to determine chromatic number of a graph directly from a realizable sequence. The method involves construction of adjacency matrix corresponding to an input sequence followed by calculation of eigen values to determine the bounds of chromatic number and consequently its chromatic number.
References
[1]
Havel, V. 1955. A remark on the existence of finite graphs. (Czech.) Ćasopis Pěst. Mat. 80 (1955), 477--480.
[2]
Hakimi, S. L. 1962. On the realizability of a set of integers as degrees of the vertices of a graph. SIAM J. Appl. Math. 10 (1962), 496--506.
[3]
Erdős, P., Gallai, T. 1960. Graphs with prescribed degree of vertices. (Hungarian) Mat. Lapok. 11 (1960), 264--274.
[4]
Ryser, H. J. 1957. Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9 (1957), 371--377.
[5]
Berge, C. 1973. Graphs and Hypergraphs. North Holland, Amsterdam, and American Elsevier, New York.
[6]
Fulkerson, D. R., Hofman, A. J., and McAndrew, M. H. 1965. Some properties of graphs with multiple edges. Can. J. Math. 17 (1965), 166--177.
[7]
Bollobs, B. 1978. Extremal Graph Theory. Acedemic Press, New York.
[8]
Grűvnbaum, B. 1969. Graphs and complexes. Report of the University of Washington, Seattle, Math., 572B, 1969.
[9]
Hässelbarth, W. 1984. Die Verzweighteit von Graphen. Match. 16 (1984), 3--17.
[10]
Sierksma, G., and Hoogeveen, H. 1991. Seven criteria for integer sequences being graphic. Journal of the Graph Theory. 15, 2 (1991), 223--231.
[11]
Tripathi, A., and Vijay, S. 2003. A note on theorem on Erdős and Gallai. Discrete Mathematics. 265 (2003), 417--420.
[12]
Dahl, G., and Flatberg, T. 2005. A remark concerning graphical sequences. Discrete Mathematics. 304 (2005), 62--64.
[13]
Tripathi, A., and Taygi, H. 2008. A simple criterion on degree sequences of graphs. Discrete Applied Mathematics. 156 (2008), 3513--3517.
[14]
Kleitman, D. J., and Wang, D. L. 1973. Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Math. 6 (1973), 79--88.
[15]
Bondy, J. A., and Murty. U. S. R. 1976. Graph Theory with Applications. American Elsevier, New York.
[16]
Eggleton, R. B. 1973. Graphic sequences and graphic polynomials: A report. Infinite and Finite Sets. 1 (1973), 385--392.
[17]
Biggs N. Algebraic Graph Theory. Cambridge: Cambridge University Press; 1993.
[18]
Cvetković, D. M., Doob, M., Sachs, H., Spectra of graphs, theory and application. Academic, New York; 1980.
[19]
Brouwer AE, Haemers WH. Spectra of graphs. Springer; 2011.
[20]
Biswas P, Paul A, Bhattacharya P, "Application of (0, 1)-Matrix in Determination of Graphic Realization of Non-Increasing Positive Integer Sequence", In: The Proceedings of the 2015 International Conference on Advanced Research in Computer Science Engineering & Technology (ICARCSET 2015) ACM 2015, Article No. 6, doi>>10.1145/2743065.2743071
[21]
Wilf, H. S., "The eigenvalues of a graph and its chromatic number," J. London Math. Soc. vol. 42, pp. 330--332, 1967.
[22]
Hoffman, A. J., "On eigenvalues and colourings of graphs," Graph Theory and its Applications (B. Harris, Ed.), Academic Press, New York, pp. 79--9, 1970.
[23]
Cvetković, D. M. "Chromatic number and spectra of graphs," Publ. Inst. Math. vol. 28, pp. 25--38, 1972.
[24]
Rosen, K. H., Handbook of Linear Algebra. CRC Press; 2007.
Index Terms
- An Efficient Way to Determine the Chromatic Number of a Graph Directly from its Input Realizable Sequence
Recommendations
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that for any pair of adjacent vertices, the set of colors appearing on the vertex and incident edges are different. The minimum number of colors required ...
On the chromatic number of general Kneser hypergraphs
In a break-through paper, Lovász 20 determined the chromatic number of Kneser graphs. This was improved by Schrijver 27, by introducing the Schrijver subgraphs of Kneser graphs and showing that their chromatic number is the same as that of Kneser ...
The chromatic number of almost stable Kneser hypergraphs
Let V(n,k,s) be the set of k-subsets S of [n] such that for all i,j@?S, we have |i-j|>=s. We define almost s-stable Kneser hypergraph KG^r([n]k)"s"-"s"t"a"b^~ to be the r-uniform hypergraph whose vertex set is V(n,k,s) and whose edges are the r-tuples ...
Comments
Information & Contributors
Information
Published In
August 2015
763 pages
ISBN:9781450333610
DOI:10.1145/2791405
- Editor:
- Indu Nair,
- General Chairs:
- Sushmita Mitra,
- Ljiljana Trajković,
- Program Chairs:
- Punam Bedi,
- Suzanne McIntosh,
- M. S. Rajasree
Copyright © 2015 ACM.
© 2015 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 10 August 2015
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
WCI '15
WCI '15: Third International Symposium on Women in Computing and Informatics
August 10 - 13, 2015
Kochi, India
Acceptance Rates
WCI '15 Paper Acceptance Rate 98 of 452 submissions, 22%;
Overall Acceptance Rate 98 of 452 submissions, 22%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 54Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in