The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number,  du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.

The issue of Cα-degree reduction of triangular Bézier surfaces is exposed. It is anticipated that both triangular Bézier surfaces are Cα-continuous at the vertices. The Euclidean norm as well as the L2−norm is used. The final solutions are given in terms of the matrix of degree raising, the Gram matrix, and the Bézier points. Moreover, it is shown that the solutions using both norms are equival...

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proportional to n, and quadratic exponential tail estimates. We further prove a corresponding theorem for the number of nodes of degree two in labelled planar graphs. The proof method is based on generating functions and sin...

We study the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d = (di) n i=1. In a previous work [1], the asymptotic cover time was obtained under a number of assumptions on d, the most significant being that di ≥ 3 for all i. Here we replace this assumption by di ≥ 2. As a corollary, we establish the asymptotic cover time fo...