Interference-Aware and Spectral-Efficient Resource Allocation Using Complete Graphs for the D2D Communication

Table 1

Parameters and definitions.

Parameter	Definition
	The number of all vertices
	Vertex set of jth complete graph
	Matrix formed by all complete graphs
	Element in the ith row and kth column of
	Sum of all elements in ith row of
	Number of RBs required by vertex
	Degree of vertex