UDC 519.17

Square difference labeling of some graphs

/ Z.O. Sherman // Kibernetika i sistemnyi analiz. — 2016. — Vol. 52, N 4. — P. 161–166.

The author considers some methods for constructing of square difference labeling of the cycle-cactus C_m⁽ⁿ⁾; one-point connection of n copies of cycle C_m and of n copies of path P₂; of one-point connection of n copies of cycle C_m and path P_n+1, as well as disjunctive union of one-point connection of n copies of cycle C_m with the path P_n. Figs: 2. Tabl.: 0. Refs: 5 titles.

Keywords:

square difference labeling, square difference graph, one-point connection cycles.


FULL TEXT

Author(s):

Шерман Зоя Александровна, аспирантка Института кибернетики им. В.М. Глушкова НАН Украины, Киев,
e-mail: sherman.zoya@rambler.ru