Skolem labelled trees and P-s square P-t Cartesian products

被引：0
|
作者：
Graham, Alasdair J. [1 ]
Pike, David A. [1 ]
Shalaby, Nabil [1 ]
机构：
[1] Mem Univ Newfoundland, Dept Math & Stat, St John, NF A1C 5S7, Canada
来源：
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2007年 / 38卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The concept of the Skolem labelled graph was introduced by Mendelsohn and Shalaby, (Discrete Math. 97 (1991), 301-317). Translating into a graph theoretical context an idea introduced by Baker, Kergin and Bonato, (Ars Combin. 63 (2002), 97-107), we prove the necessary and sufficient conditions for maximum (hooked) Skolem labelling P-s square P-t Cartesian products. We also provide an algorithm used to generate Skolem labellings of trees as well as data generated using this algorithm.
引用
收藏
页码：101 / 115
页数：15
相关论文
共 50 条
12345