Yazar "Omran, Ahmed Abed Ali" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • Küçük Resim Yok
    Yayın
    Binary operation graphs
    (AIP Publishing, 2019) Al-Harere, Manal Naji; Omran, Ahmed Abed Ali
    A graph labeling is an assignment of integers to the vertices, edges, or to both, and it is subject to certain conditions. In this paper, a new concept of graph labeling called binary operation labeling is introduced. Let G = (V, E) be a (n, m)-graph and let f : V(G) ? 1, 2, ..., n be a bijection. We define f ? on E(G) by f ? (uv) = (f(u) + f(v))/2 if both f(u) and f(v) are odd or both are even and f ? (uv) = (f(u)f(v))/2 if u is odd and v is even or vice versa for each uv ? E(G). If f ? is injective on E(G), then f is called a binary operation labeling. The graph G is said to be a binary operation graph if G admits a binary operation labeling. Some results for this new type of labeling are contributed.
  • Küçük Resim Yok
    Yayın
    Binary operation graphs
    (Maltepe Üniversitesi, 2019) Al-Harere, Manal Naji; Omran, Ahmed Abed Ali
    A graph labeling is an assignment of integers to the vertices, edges, or to both, and it is subject to certain conditions. In this paper, a new concept of graph labeling called binary operation labeling is introduced. Let G = (V, E) be a (n, m)-graph and let f : V(G) ? 1, 2, ..., n be a bijection. We define f ? on E(G) by f ? (uv) = (f(u) + f(v))/2 if both f(u) and f(v) are odd or both are even and f ? (uv) = (f(u)f(v))/2 if u is odd and v is even or vice versa for each uv ? E(G). If f ? is injective on E(G), then f is called a binary operation labeling. The graph G is said to be a binary operation graph if G admits a binary operation labeling. Some results for this new type of labeling are contributed.