This is a preview. Log in through your library . Abstract This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other ...
The inverse degree of a graph G with no isolated vertices is defined as the sum of reciprocal of vertex degrees of the graph G. In this paper, we obtain several lower and upper bounds on inverse ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback