Group labelings of graphs
Copyright policy )Group labelings of graphs
AbstractGiven a graph Γ an abelian group G, and a labeling of the vertices of Γ with elements of G, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such an edge labeling is called compatible. For vertex labelings satisfying these conditions, the set of compatible edge labelings is enumerated.
- Massachusetts Institute of Technology United States
Graph theory, edge labeling, group labelings, graph, Enumeration in graph theory, abelian group, Graphs and abstract algebra (groups, rings, fields, etc.), Abelian groups, enumeration
Graph theory, edge labeling, group labelings, graph, Enumeration in graph theory, abelian group, Graphs and abstract algebra (groups, rings, fields, etc.), Abelian groups, enumeration
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!