Algorithms for Zumkeller Labeling of Full Binary Trees and Square Grids

被引：5

作者：

Balamurugan, B. J. ^{[1
]}

Thirusangu, K. ^{[2
]}

Thomas, D. G. ^{[3
]}

机构：

[1] Agni Coll Technol Thalambur, Dept Math, Madras 600130, Tamil Nadu, India

[2] SIVET Coll Gowrivakkam, Dept Math, Madras 600073, Tamil Nadu, India

[3] Madras Christian Coll Tambaram, Dept Math, Madras 600059, Tamil Nadu, India

来源：

ARTIFICIAL INTELLIGENCE AND EVOLUTIONARY ALGORITHMS IN ENGINEERING SYSTEMS, VOL 2 | 2015年 / 325卷

关键词：

Zumkeller labeling; Number theory; Code-making; Breaking;

D O I：

10.1007/978-81-322-2135-7_21

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Let G = (V, E) be a graph. An injective function f: V -> N is said to be a Zumkeller labeling of the graph G, if the induced function f*: E -> N defined as f*(xy) = f(x) f(y) is a Zumkeller number for all xy is an element of E, x, y is an element of V. A graph G = (V, E) which admits a Zumkeller labeling is called a Zumkeller graph. In this paper, we provide algorithms for Zumkeller labeling of full binary trees and grid graphs.

引用

页码：183 / 192

页数：10