On the generation of alpha graphs

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Christian Barrientos¹ 

[1] Department of Mathematics, Valencia College

关键词: {$\alpha$}-labeling;    Graceful graph;    Amalgamation;    Duplication;    Replication;   

DOI  :  10.13069/jacodesmath.1111733

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

Graceful labelings constitute one of the classical subjects in the area of graph labelings; among them, the most restrictive type are those called {$\alpha$}-labelings. In this work, we explore new techniques to generate {$\alpha$}-labeled graphs, such as vertex and edge duplications, replications of the entire graph, and $k$-vertex amalgamations. We prove that for some families of graphs, it is possible to duplicate several vertices or edges. Using $k$-vertex amalgamations we obtain an {$\alpha$}-labeling of a graph that can be decomposed into multiple copies of a given {$\alpha$}-labeled graph as well as a robust family of irregular grids that can {$\alpha$}-labeled.

【 授权许可】

CC BY