On multigraphic and potentially multigraphic sequences

[1] D. de Caen, An upper bound on the sum of squares of degrees in a graph, Discrete Math. 185 (1998) 245–248. )3810.1016/S0012-365X(97)00213-6Search in Google Scholar

[2] V. Chungphaisan, Conditions for a sequences to be r-graphic, Discrete Math. 7 (1974) 31–39. )36, 3710.1016/S0012-365X(74)80016-6Search in Google Scholar

[3] P. Erdős, T. Gallai, Graphs with prescribed degrees (in Hungarian) Matematikai Lapok 11(1960) 264–274. )36Search in Google Scholar

[4] P. Erdős, M. S. Jacobson, J. Lehel, Graphs realizing the same degree sequences and their respective clique numbers, in: Graph Theory, Combinatorics and Ap- plications, vol. 1, John Wiley and Sons, New York, 1991, 439–449. )37Search in Google Scholar

[5] D. R. Fulkerson, A. J. Ho_man, M. H. McAndrew, Some properties of graphs with multiple edges, Canad. J. Math. 17 (1965) 166–177. )3610.4153/CJM-1965-016-2Search in Google Scholar

[6] D. J. Kleitman, D. L. Wang, Algorithm for constructing graphs and digraphs with given valencies and factors, Discrete Math. 6 (1973) 79–88. )3610.1016/0012-365X(73)90037-XSearch in Google Scholar

[7] J. S. Li, Z. X. Song, R. Luo, The Erdős-Jacobson-Lehel conjecture on potentially pk-graphic sequences is true, Sci. China Ser. A 41 (1998) 510–520. )3710.1007/BF02879940Search in Google Scholar

[8] J. S. Li, Z. X. Song, An extremal problem on the potentially pk-graphic sequence, Discrete Math. 212 (2000) 223–231. )3710.1016/S0012-365X(99)00289-7Search in Google Scholar

[9] S. Pirzada, An Introduction to Graph Theory, Universities Press, Orient Blak- swan, Hyderabad, India 2012. )36Search in Google Scholar

[10] S. Pirzada, B. A. Chat, Potentially graphic sequences of split graphs, Kragujevac J. Math. 38, 1 (2014) 73–81. )37, 3810.5937/KgJMath1401073PSearch in Google Scholar

[11] S. Pirzada, B. A. Chat, F. A. Dar, Graphical sequences of some family of inducedsubgraphs, J. Algebra Comb. Discrete Appl. 2(2) (2015) 95–109. )38 10.13069/jacodesmath.39202Search in Google Scholar

[12] A. R. Rao, The clique number of a graph with a given degree sequence, Proc. Symposium on Graph Theory (ed. A. R. Rao, Macmillan and Co. India Ltd, I.S.I. Lecture Notes Series, 4 (1979) 251–267. )37Search in Google Scholar

[13] J. H. Yin, Conditions for r-graphic sequences to be potentially Kr m+1 -graphic, Discrete Math. 309 (2009) 6271–6276. )3710.1016/j.disc.2009.06.014Search in Google Scholar

[14] J. H. Yin, A Havel-Hakimi type procedure and a sufficient condition for a se- quence to be potentially Sr;s-graphic, Czechoslovak Math. J. 62,3 (2012) 863– 867. )37, 3810.1007/s10587-012-0051-4Search in Google Scholar