you answer this question before but I didn't understand your answer, like why x = - 1 Could you please provide simpler answer?

I need more explanation

A graph G is a star if it has a vertex x adjacent to every other vertex and r is the only neighbour of every other vertex. Given the adjacency matrix of a graph G, design an O(n2) algorithms that prints YES if G is a star and NO otherwise