Resumen de Some new classes of vertex-mean graphs.
A vertex-mean labeling of a (p, q) graph G = (V, E) is defined as an injective function f : E ⟶ {0, 1, 2, ..., q*} , q* = max (p,q) such that the function fV : V ⟶ N defined by the rule
A vertex-mean labeling of a (p, q) graph G = (V, E) is defined as an injective function f : E ⟶ {0, 1, 2, ..., q*} , q* = max (p,q) such that the function fV : V ⟶ N defined by the rule
