Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Acta Universitatis Sapientiae, Informatica

The Journal of "Sapientia" Hungarian University of Transylvania

2 Issues per year

Open Access
Online
ISSN
2066-7760
See all formats and pricing
More options …

On multigraphic and potentially multigraphic sequences

Dedicated to the memory of Antal Iványi

Shariefuddin Pirzada / Bilal Ahmad Chat / Uma Tul Samee
Published Online: 2017-08-01 | DOI: https://doi.org/10.1515/ausi-2017-0003

Abstract

An r-graph(or a multigraph) is a loopless graph in which no two vertices are joined by more than r edges. An r-complete graph on n vertices, denoted by Kn(r) , is an r-graph on n vertices in which each pair of vertices is joined by exactly r edges. A non-increasing sequence π = (d1, d2, ..., dn) of non-negative integers is said to be r-graphic if it is realizable by an r-graph on n vertices. An r-graphic sequence π is said to be potentially SL;M(r) -graphic if it has a realization containing SL;M(r) as a subgraph. We obtain conditions for an r-graphic sequence to be potentially S(r) L;M-graphic. These are generalizations from split graphs to p-tuple r-split graph.

MSC 2010: 05C07

Keywords: multigraph; multigraphic sequence; potentially multigraphic sequences; split graph

References

  • [1] D. de Caen, An upper bound on the sum of squares of degrees in a graph, Discrete Math. 185 (1998) 245–248. )38Google Scholar

  • [2] V. Chungphaisan, Conditions for a sequences to be r-graphic, Discrete Math. 7 (1974) 31–39. )36, 37Web of ScienceCrossrefGoogle Scholar

  • [3] P. Erdős, T. Gallai, Graphs with prescribed degrees (in Hungarian) Matematikai Lapok 11(1960) 264–274. )36Google 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. )37Google 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. )36Google 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. )36CrossrefGoogle 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. )37CrossrefGoogle Scholar

  • [8] J. S. Li, Z. X. Song, An extremal problem on the potentially pk-graphic sequence, Discrete Math. 212 (2000) 223–231. )37Google Scholar

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

  • [10] S. Pirzada, B. A. Chat, Potentially graphic sequences of split graphs, Kragujevac J. Math. 38, 1 (2014) 73–81. )37, 38Google 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 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. )37Google Scholar

  • [13] J. H. Yin, Conditions for r-graphic sequences to be potentially Kr m+1 -graphic, Discrete Math. 309 (2009) 6271–6276. )37Web of ScienceGoogle 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, 38CrossrefGoogle Scholar

About the article

Received: 2016-11-30

Revised: 2017-01-19

Published Online: 2017-08-01

Published in Print: 2017-07-26


Citation Information: Acta Universitatis Sapientiae, Informatica, Volume 9, Issue 1, Pages 35–47, ISSN (Online) 2066-7760, DOI: https://doi.org/10.1515/ausi-2017-0003.

Export Citation

© 2017. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. BY-NC-ND 4.0

Comments (0)

Please log in or register to comment.
Log in