Advertisement
Published in:
2011 | OriginalPaper | Chapter
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
Authors : Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby
Published in: Combinatorial Algorithms
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A completely separating system (CSS) on a finite set [
n
] is a collection
$\mathcal C$
of subsets of [
n
] in which for each pair
a
≠
b
∈ [
n
], there exist
$A, B\in\mathcal C$
such that
a
∈
A
,
b
∉
A
and
b
∈
B
,
a
∉
B
.
An antimagic labeling of a graph with
p
vertices and
q
edges is a bijection from the set of edges to the set of integers {1,2, ...,
q
} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling.
In this paper we show that there is a relationship between CSSs on a finite set and antimagic labeling of graphs. Using this relationship we prove the antimagicness of various families of regular graphs.