Acta Mathematica Sinica, English Series

, Volume 35, Issue 2, pp 161–171 | Cite as

Extremal Problems on Components and Loops in Graphs

  • Sadik Delen
  • Ismail Naci CangulEmail author


The authors recently defined a new graph invariant denoted by Ω(G) only in terms of a given degree sequence which is also related to the Euler characteristic. It has many important combinatorial applications in graph theory and gives direct information compared to the better known Euler characteristic on the realizability, connectedness, cyclicness, components, chords, loops etc. Many similar classification problems can be solved by means of Ω. All graphs G so that \(\Omega(G)\leq-4\) are shown to be disconnected, and if \(\Omega(G)\geq-2\), then the graph is potentially connected. It is also shown that if the realization is a connected graph and \(\Omega(G)\geq-2\), then certainly the graph should be a tree. Similarly, it is shown that if the realization is a connected graph G and \(\Omega(G)\geq0\), then certainly the graph should be cyclic. Also, when \(\Omega(G)\geq-4\), the components of the disconnected graph could not all be cyclic and if all the components of G are cyclic, then \(\Omega(G)\geq0\). In this paper, we study an extremal problem regarding graphs. We find the maximum number of loops for three possible classes of graphs. We also state a result giving the maximum number of components amongst all possible realizations of a given degree sequence.


Graph characteristic connectedness cyclic graph acyclic graph degree sequence 

MR(2010) Subject Classification

05C10 05C30 05C35 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Discrete Math., 136, 3–20 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    Barrus, M. D., Donovan, E.: Neighborhood degree lists of graphs. Discrete Math., 341(1), 175–183 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    Choudum, S. A.: On forcibly connected graphic sequences. Discrete Math., 96, 175–181 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Delen, S., Cangul, I. N.: A New Graph Invariant. Turkish Journal of Analysis and Number Theory, 6(1), 30–33 (2018)MathSciNetCrossRefGoogle Scholar
  5. [5]
    Delen, S., Cangul, I. N.: The fundamental realizations of degree sequences, preprintGoogle Scholar
  6. [6]
    Hakimi, S. L.: On the realizability of a set of integers as degrees of the vertices of a graph. J. SIAM Appl. Math., 10, 496–506 (1962)MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    Havel, V.: A remark on the existence of finite graphs (Czech). Časopic Pĕst. Mat., 80, 477–480 (1955)zbMATHGoogle Scholar
  8. [8]
    Triphati, A., Venugopalan, S., West, D. B.: A short constructive proof of the Erdös-Gallai characterization of graphic lists. Discrete Math., 310, 843–844 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    Tyshkevich, R. I., Chernyak, A. A., Chernyak, Zh. A.: Graphs and degree sequences. Cybernetics, 23(6), 734–745 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    Zverovich, I. E., Zverovich, V. E.: Contributions to the theory of graphic sequences. Discrete Math., 105, 293–303 (1992)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Institute of Mathematics, Academy of Mathematics and Systems Science (CAS), Chinese Mathematical Society (CAS) and Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Mathematics DepartmentUludag UniversityBursaTurkey

Personalised recommendations