Definition
Given a graph G, we denote the set of edges by E(G) and the vertices by V(G). Let q be the cardinality of E(G) and p be that of V(G). Once a labeling of the edges is given, a vertex u of the graph is labeled by the sum of the labels of the edges incident to it, modulo p. Or, in symbols, the induced labeling on the vertex u is given by
where V(u) is the label for the vertex and E(e) is the assigned value of an edge incident to u.
The problem is to find a labeling for the edges such that all the labels from 1 to q are used once and the induced labels on the vertices run from 0 to p − 1. In other words, the resulting set for labels of the edges should be and for the vertices.
A graph G is said to be edge-graceful if it admits an edge-graceful labeling.
Read more about this topic: Edge-graceful Labeling
Famous quotes containing the word definition:
“According to our social pyramid, all men who feel displaced racially, culturally, and/or because of economic hardships will turn on those whom they feel they can order and humiliate, usually women, children, and animals—just as they have been ordered and humiliated by those privileged few who are in power. However, this definition does not explain why there are privileged men who behave this way toward women.”
—Ana Castillo (b. 1953)
“The very definition of the real becomes: that of which it is possible to give an equivalent reproduction.... The real is not only what can be reproduced, but that which is always already reproduced. The hyperreal.”
—Jean Baudrillard (b. 1929)
“Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.”
—Nadine Gordimer (b. 1923)