scientific article; zbMATH DE number 4068907

From MaRDI portal
Publication:3801580





Given a finite graph \(\Gamma\) and an Abelian group G, a vertex labeling of \(\Gamma\) (by G) is a function f: V(\(\Gamma)\to G\), and an edge labeling is a function g: E(\(\Gamma)\to G\). We say that g is induced by f if for all \(\{\) u,v\(\}\in E(\Gamma)\) one has \(g(\{u,v\})=f(u)f(v)\) holding in G. An edge labeling is called an induced labeling if it is induced by some vertex labeling. It is shown that all induced labelings of a graph \(\Gamma\) by a given group G are induced by the same number of vertex labelings. If \(\Gamma\) is connected, this number is \(| G|\) when \(\Gamma\) is bipartite and is the order of the maximum (possibly trivial) elementary Abelian 2- subgroup G' in G otherwise. If, moreover, G is finite, then \(\Gamma\) admits \(| G|^{| V| -1}\) induced labelings if \(\Gamma\) is bipartite and \(| G|^{| V|}/| G'|\) induced labelings otherwise. Finally, edge labelings which are induced labelings are characterized.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801580)