The well-known Euler characteristic is an invariant of graphs defined by means of the vertex, edge and face numbers of a graph, to determine the genus of the underlying surface of the graph. By means of it, it is possible to determine the vertex, edge and face numbers of all possible graphs which can be drawn in a given orientable/non-orientable surface. In this paper, by means of a given degree sequence, a new number denoted by which is related to Euler characteristic and has several applications in Graph Theory is defined. This formula gives direct information compared with the Euler characteristic on the realizability, number of realizations, connectedness, being acyclic or cyclic, number of components, chords, loops, pendant edges, faces, bridges etc.
| [1] | S. L. Hakimi, On the realizability of a set of integers as degrees of the vertices of a graph, J. SIAM Appl. Math., 10 (1962), 496-506.View Article |
| [2] | V. Havel, A remark on the existence of finite graphs (Czech), Časopic Pěst. Mat., 80 (1955), 477-480. |
