A blabelling of graph G is an integer labelling of V(G) such that adjacent vertices have labels that differ by at least two and vertices distance two apart have labels that differ by at least one.â€¦ (More)

For a graph G, an L(2, 1)-labeling of G with span k is a mapping L â†’ {0, 1, 2, . . . , k} such that adjacent vertices are assigned integers which differ by at least 2, vertices at distance two areâ€¦ (More)

A graph is bicubic if it is bipartite and 3-regular. A graph is hamiltonian if it contains a circuit that includes every vertex. A graph is cyclically 4-edge connected if any set of edges whoseâ€¦ (More)

Let G = (V, E) be a finite loopless graph and let (A,+) be an abelian group with identity 0. Then an A-magic labeling of G is a function Ï† from E into A âˆ’ {0} such that for some a âˆˆ A,âˆ‘eâˆˆE(v) Ï†(e) =â€¦ (More)