3 problems

Let $G$ be a graph of order $n$ with no connected components of order less than $3$. A $\Gamma$-irregular labeling is a labeling of the edges of $G$ by elements of an abelian group…

Let $G$ be as in Theorem 4.2: a disconnected graph whose non-trivial components are all isomorphic to a graph $H$. Let $dern(G)$ denote the minimum number of degree-associated edge…

Let $G$ be a disconnected graph whose components are all isomorphic to a graph $H$, and let $ern(G)$ be the minimum number of edge-cards needed to determine $G$ up to isomorphism.…