An antimagic labeling of a directed graph D with n vertices and m arcs is a bijection from the set of arcs of D to the integers { 1 , … , m } such that all n oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum o...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=O107952801
2021년
-
0364-9024
1097-0118
SCI;SCIE;SCOPUS
학술저널
676-690 [※수록면이 p5 이하이면, Review, Columns, Editor's Note, Abstract 등일 경우가 있습니다.]
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
An antimagic labeling of a directed graph D with n vertices and m arcs is a bijection from the set of arcs of D to the integers { 1 , … , m } such that all n oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum o...
An antimagic labeling of a directed graph
D with
n vertices and
m arcs is a bijection from the set of arcs of
D to the integers
{
1
,
…
,
m
} such that all
n oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it. A graph has an antimagic orientation if it has an orientation that admits an antimagic labeling. Hefetz, Mütze, and Schwartz conjectured that every connected graph admits an antimagic orientation. In this paper, we show that every bipartite graph with no vertex of degree 0 or 2 admits an antimagic orientation and every graph with minimum degree at least 33 admits an antimagic orientation.
Berge–Fulkerson coloring for C ( 12 )‐linked permutation graphs
Extremal graphs for odd wheels