A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
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/nonorientable surface. In this paper, by means of a given degree sequence, a new number denoted by ( ) which is related to Euler characteristic and has severaldoi:10.12691/tjant-6-1-4 fatcat:tgorrrl3ufdbddrztsgquz3jya