A function such that given a Graph G and vertex say v as input to a function

It should output the sum of the degrees of all the neighbors of that vertex v in that graph G 

Kind help thank you 

Given a list say

A=[1, 2,6,7,9,10,15,17]

If I give a=3 and b=5

I should get a sublist containing all elements from 3 to 5 in index

That is [6,7,9] sublist of the above list

Kind help 

Given two lists say of same number of elements 

A = [1,0,3,4,5,5]

B=[0,1,2,6,3,6]

How to write a code find number of elements of A which are greater than the number of elements of B index wise in the above 1>0,3>2,5>3 so three elements. 

And also the number of elements of B greater than the number of elements A index wise

1>0,6>4,6>4.hence 3 elements

Index wise compared to note 

Kind help 

Given a Graph say G with its adjacency matrix say. 

Consider a edge uv in the graph say 

how to find the number of vertices of 

Case1 : The number of vertices of graph G whose distance to the vertex v is smaller than the distance to the vertex u.

Case 2:  The  number of vertices of graph G whose distance to the vertex u
is smaller than the distance to the vertex v.

To u is adjacent to V that is uv is a edge here. 

If I have a Polynomial of the form say 

c1x^{a1} y^{b1} +c2x^{a2} y^{b2} +... +cnx^{an} y^{bn}

Now I want to form a list say of the form

L=[[[a1, b1], c1], [[a2, b2], c2],.... [[an, bn], cn]] 

Kind help with a peice of code