Sequence of degrees of a graph with two colors

39 Views Asked by At

enter image description hereWith respect to the graph

Another concept central to an understanding of fractional isomorphism is that of the iterated degree sequence of a graph. Recall that the degree of a vertex $v\in G$ is the cardinality of its neighbor set: $d(v) = |N(v)|$. The degree sequence of a graph $G$ is the multiset of the degrees of the vertices, $d_1(G) = \{d(v) : v\in V (G)\}$.

Why is the blue vertices have degree sequence {3, 3, 4} and the yellow vertices have degree sequence {3, 4, 4, 4} ?.