What’s right?

A、In any graph, the sum of degrees of vertices is equal to twice the number of edges.;
B、The necessary conditions for isomorphism of two graphs are equal order, equal edge number and equal degree sequence.;
C、A graph with a given point or edge weight is called a weighted graph.;
D、A graph with specified symbols for both vertices and edges is called a calibration graph.